On the coincidence of Grünberg-Kegel graphs of a finite simple group and its proper subgroup. (Q2516600): Difference between revisions

Let \(G\) be a finite group. The Gruenberg-Kegel graph of \(G\), denoted by \(GK(G)\), is a graph with vertex set the set of prime divisors of the order of \(G\) such that two primes \(p\) and \(q\) are joined by an edge if \(G\) has an element of order \(pq\). In the paper under review the author determines simple groups with a subgroup \(H\) such that \(GK(G)=GK(H)\).