A classification of the prime graphs of pseudo-solvable groups
From MaRDI portal
Abstract: The prime graph of a finite group (also known as the Gruenberg-Kegel graph) has as its vertices the prime divisors of , and is an edge in if and only if has an element of order . Since their inception in the 1970s these graphs have been studied extensively; however, completely classifying the possible prime graphs for larger families of groups remains a difficult problem. For solvable groups such a classification was found in 2015. In this paper we go beyond solvable groups for the first time and characterize prime graphs of a more general class of groups we call pseudo-solvable. These are groups whose composition factors are either cyclic or . The classification is based on two conditions: the vertices form a triangle in or form a triangle for some prime .
Recommendations
Cites work
- A characterization of the prime graphs of solvable groups.
- Finite group theory.
- Groups Having Strongly Self-Centralizing 3-Centralizers
- scientific article; zbMATH DE number 3526920 (Why is no real title available?)
- On Brauer's \(k(B)\)-problem
- Prime graph components of finite groups
- Solvable groups with a small number of prime divisors in the element orders
- The classification of the finite simple groups
- The prime graphs of some classes of finite groups
Cited in
(2)
This page was built for publication: A classification of the prime graphs of pseudo-solvable groups
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6146260)