A characterization of the prime graphs of solvable groups. (Q492997)

Let \(G\) be a finite group and \(\pi(G)\) be the set of prime divisors of \(|G|\). The \textit{prime graph} \(\Gamma_G\) of \(G\), is the graph with vertex set \(\pi(G)\) and edges \(\{p,q\}\in E(\Gamma_G)\) if and only if there exists an element of order \(pq\) in \(G\). The main theorem in this paper is Theorem 2: An unlabeled graph \(\mathcal G\) is isomorphic to the prime graph of some finite solvable group if and only if its complement \(\overline{\mathcal G}\) is \(3\)-colorable and triangle-free. An essential tool for the proof of the results contained in this paper is the so-called \textit{Lucido's Three Primes Lemma} [\textit{M. S. Lucido}, Boll. Unione Mat. Ital., Sez. B, Artic. Ric. Mat. (8) 5, No. 1, 131-148 (2002; Zbl 1097.20022)] which asserts that if \(G\) is a finite solvable group and \(p,q,r\in\pi(G)\), then \(G\) contains an element of order the product of two of these three primes.