English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

The prime graph, or Gruenberg--Kegel graph, of a finite group $G$ is thegraph $\Gamma(G)$ whose vertices are the prime divisors of $|G|$, and whoseedges are the pairs $\{p,q\}$ for which $G$ contains an element of order $pq$.A finite group $G$ is recognisable by its prime graph if every finite group $H$with $\Gamma(H)=\Gamma(G)$ is isomorphic to $G$. By a result of Cameron andMaslova, every such group must be almost simple, so one natural case toinvestigate is that in which $G$ is one of the $26$ sporadic simple groups.Existing work of various authors answers the question of recognisability byprime graph for all but three of these groups, namely the Monster, $\text{M}$,the Baby Monster, $\text{B}$, and the first Conway group, $\text{Co}_1$. Weprove that these three groups are recognisable by their prime graphs.

$\text{M}$, $\text{B}$ and $\text{Co}_1$ are recognisable by their prime graphs