A classification of the prime graphs of pseudo-solvable groups (Q6146260)

The prime graph \(\Gamma(G)\) of a finite group \(G\) has as its vertices the prime divisors of the order of \(G\), and \(p-q\) is an edge in \(\Gamma(G)\) if and only if \(G\) has an element of order \(pq.\) \textit{A. Gruber} et al. [J. Algebra 442, 397--422 (2015; Zbl 1331.20029)] studied the prime graphs of solvable groups and obtained the following characterization: A simple graph is isomorphic to the prime graph of a solvable group if and only if the complement of the graph is \(3\)-colorable and triangle-free. The authors of this paper take the first step into the realm of non-solvable groups by completely characterizing the prime graphs of what they call pseudo-solvable groups. These are finite groups whose composition factors are either cyclic or isomorphic to the alternating group on five elements. The classification is based on two conditions: The vertices \(\{2; 3; 5\}\) form a triangle in the complement of \(\Gamma(G)\) or \(\{p, 3, 5\}\) form a triangle for some prime \(p \neq 2.\)