Classifying prime graphs of finite groups -- a methodical approach
From MaRDI portal
Let \(G\) be a finite group. The prime graph of \(G\) is a graph whose vertices are the primes dividing the order of \(G\) where two vertices \(p\) and \(q\) are joined by an edge if and only if \(G\) has an element of order \(pq\). A \(T\)-solvable group is a group whose composition factors are cyclic groups of prime order or isomorphic to a fixed finite simple group \(T\). The authors classify the prime graphs of \(T\)-solvable groups such that the order of \(T\) has exactly four prime divisors.
Cites work
- A characterization of the prime graphs of solvable groups.
- A classification of the prime graphs of pseudo-solvable groups
- A Hall-Higman-Shult type theorem for arbitrary finite groups.
- Finite group theory.
- Gruenberg-Kegel graphs: cut groups, rational groups and the prime graph question
- scientific article; zbMATH DE number 3906699 (Why is no real title available?)
- scientific article; zbMATH DE number 3933295 (Why is no real title available?)
- scientific article; zbMATH DE number 479556 (Why is no real title available?)
- scientific article; zbMATH DE number 1564071 (Why is no real title available?)
- scientific article; zbMATH DE number 3212917 (Why is no real title available?)
- scientific article; zbMATH DE number 2217072 (Why is no real title available?)
- On realizability of a graph as the prime graph of a finite group
- On simple \(K_4\)-groups
- Perfect Frobenius complements
- Prime graph components of finite groups
- The Character Tables for SL(3, q), SU(3, q2), PSL(3, q), PSU(3, q2)
- The Gruenberg-Kegel graph of finite solvable rational groups
- The prime graphs of groups with arithmetically small composition factors
- The prime graphs of some classes of finite groups
This page was built for publication: Classifying prime graphs of finite groups -- a methodical approach
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6905582)