Classification of the Prime Graphs of -, -, and -Solvable Groups
arXiv:2410.21063
Abstract
For a finite group , the vertices of the prime graph are the primes that divide , and two vertices and are connected by an edge if there is an element of order in . Prime graphs of solvable groups have been classified, and prime graphs of groups whose noncyclic composition factors are isomorphic to a single nonabelian simple group have been classified in the case where has order divisible by exactly three or four distinct primes, except for the cases , , and , which in some sense are the hardest cases. In this paper, we complete the classification for , , and , with the latter two being the first cases ever studied where has prime factors which do not divide . The groups studied in this paper are also the first ones requiring knowledge of their Brauer character tables to complete the classification task.
32 pages, 4 figures