21.94 (2026)

Open

The Gruenberg–Kegel graph (or the prime graph) $GK(G)$ of a finite group $G$ is a labelled graph with vertex set consisting of all prime divisors of the order of $G$ in which different vertices $p$ and $q$ are adjacent if and only if $G$ contains an element of order $pq$. Let $\overline{GK}(G)$ denote the abstract graph obtained from $GK(G)$ by removing all labels. A finite group $G$ is said to be recognizable by the isomorphism type of its Gruenberg–Kegel graph if there are no finite groups $H \not\cong G$ with $\overline{GK}(H)$ isomorphic to $\overline{GK}(G)$.

Are there infinitely many (pairwise non-isomorphic) finite groups which are recognizable by the isomorphism type of the Gruenberg–Kegel graph?

Comments

All comments are the responsibility of the user. Comments appearing on this page are not verified for correctness. Please keep posts mathematical and on topic. If you want to submit a proof (or a partial proof), please use the dedicated proof submission form rather than posting it in the comments.
Order by newest first or oldest first.

No comments yet. Be the first to comment.

Proof claims

Proof claims are the responsibility of the submitter. Appearance here does not mean the claim has been checked for mathematical correctness. Moderators only screen for spam, abuse, and obviously low-effort submissions.

No proof claims yet.