Finite groups whose prime graphs do not contain triangles. I (Q2396365): Difference between revisions

The prime graph \(\Gamma (G)\) of a finite group \(G\) has the prime divisors of \(|G|\) as vertices and the vertices \(p\), \(q\) are joined when there exists an element of order \(pq\) in \(G\). The paper under review studies the graph \(\Gamma (G)\) under the assumption that it contains no \(3\)-cycles. In Theorem 1, information is obtained about the finite solvable groups \(G\) with \(\Gamma (G)\) free of \(3\)-cycles in the presence of extra constraints (as for example the graph is disconnected, or connected, or is a chain of small length, or is a cycle of small length). Theorem 2 gives the complete list of the finite almost simple groups \(G\) with \(\Gamma (G)\) free of \(3\)-cycles. As a direct consequence, when \(G\) is simple , then \(\Gamma (G)\) is disconnected and \(|\pi (G)|\leq 8\).