Recognisability of the sporadic groups by the isomorphism types of their prime graphs

The prime graph , also called the Gruenberg–Kegel graph , of a finite group 𝐺 is the labelled graph <m:math xmlns:m="http://www.w3.org/1998/Math/MathML"> <m:mrow> <m:mi mathvariant="normal">Γ</m:mi> <m:mo>⁢</m:mo> <m:mrow> <m:mo stretchy="false">(</m:mo> <m:mi>G</m:mi> <m:mo stretchy="false">)</m:mo> </m:mrow> </m:mrow> </m:math> Γ(G) with vertices the prime divisors of <m:math xmlns:m="http://www.w3.org/1998/Math/MathML"> <m:mrow> <m:mo stretchy="false">|</m:mo> <m:mi>G</m:mi> <m:mo stretchy="false">|</m:mo> </m:mrow> </m:math> G and edges the pairs <m:math xmlns:m="http://www.w3.org/1998/Math/MathML"> <m:mrow> <m:mo stretchy="false">{</m:mo> <m:mi>p</m:mi> <m:mo>,</m:mo> <m:mi>q</m:mi> <m:mo stretchy="false">}</m:mo> </m:mrow> </m:math> \{p,q\} for which 𝐺 contains an element of order <m:math xmlns:m="http://www.w3.org/1998/Math/MathML"> <m:mrow> <m:mi>p</m:mi> <m:mo>⁢</m:mo> <m:mi>q</m:mi> </m:mrow> </m:math> pq . A group 𝐺 is recognisable by its prime graph if every group 𝐻 with <m:math xmlns:m="http://www.w3.org/1998/Math/MathML"> <m:mrow> <m:mrow> <m:mi mathvariant="normal">Γ</m:mi> <m:mo>⁢</m:mo> <m:mrow> <m:mo stretchy="false">(</m:mo> <m:mi>H</m:mi> <m:mo stretchy="false">)</m:mo> </m:mrow> </m:mrow> <m:mo>=</m:mo> <m:mrow> <m:mi mathvariant="normal">Γ</m:mi> <m:mo>⁢</m:mo> <m:mrow> <m:mo stretchy="false">(</m:mo> <m:mi>G</m:mi> <m:mo stretchy="false">)</m:mo> </m:mrow> </m:mrow> </m:mrow> </m:math> Γ(H)=Γ(G) is isomorphic to 𝐺. Cameron and Maslova have shown that every group that is recognisable by its prime graph is almost simple. This justifies the significant amount of attention that has been given to determining which simple or almost simple groups are recognisable by their prime graphs. This problem has been completely solved for certain families of simple groups, including the sporadic groups. A natural extension of the problem is to determine which groups are recognisable by their unlabelled prime graphs, i.e. by the isomorphism types of their prime graphs. Here we determine which of the sporadic finite simple groups are recognisable by the isomorphism types of their prime graphs. We also show that, for every sporadic group 𝐺 that is not recognisable by the isomorphism type of <m:math xmlns:m="http://www.w3.org/1998/Math/MathML"> <m:mrow> <m:mi mathvariant="normal">Γ</m:mi> <m:mo>⁢</m:mo> <m:mrow> <m:mo stretchy="false">(</m:mo> <m:mi>G</m:mi> <m:mo stretchy="false">)</m:mo> </m:mrow> </m:mrow> </m:math> Γ(G) , there are infinitely many groups 𝐻 with <m:math xmlns:m="http://www.w3.org/1998/Math/MathML"> <m:mrow> <m:mrow> <m:mi mathvariant="normal">Γ</m:mi> <m:mo>⁢</m:mo> <m:mrow> <m:mo stretchy="false">(</m:mo> <m:mi>H</m:mi> <m:mo stretchy="false">)</m:mo> </m:mrow> </m:mrow> <m:mo>≅</m:mo> <m:mrow> <m:mi mathvariant="normal">Γ</m:mi> <m:mo>⁢</m:mo> <m:mrow> <m:mo stretchy="false">(</m:mo> <m:mi>G</m:mi> <m:mo stretchy="false">)</m:mo> </m:mrow> </m:mrow> </m:mrow> </m:math> Γ(H)Γ(G) .