Quasirecognition by the prime graph of the group \(C_n(2)\), where \(n\neq 3\) is odd. (Q648440): Difference between revisions

Let \(\pi(G)\) be the set of prime divisors of the order of a finite group \(G\). The prime graph (or Gruenberg-Kegel graph) of \(G\) is the undirected graph \(\Gamma(G)\) with vertex set \(\pi(G)\) in which two distinct primes \(p,q\) are adjacent iff \(G\) contains an element of order \(pq\). The authors prove that every finite group \(G\) whose prime graph coincides with the prime graph of the finite simple group \(C_n(2)\), \(n\) odd and \(n>3\), has a unique non-Abelian composition factor and this factor is isomorphic to \(C_n(2)\).