Kourovka Notebook Problem 21.94
Statement
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 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 G with GK(H) isomorphic to GK(G). Are there infinitely many (pairwise non-isomorphic) finite groups which are recognizable by the isomorphism type of the Gruenberg--Kegel graph?
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.