Realizing Gruenberg-Kegel graphs of -solvable groups with structurally simplified extensions of
Abstract: Given a finite group , its prime graph (also known as its Gruenberg-Kegel graph) is the graph whose vertices are the prime divisors of and where edges exist whenever contains an element of order . We continue the study of prime graphs for -solvable groups; that is, groups whose composition factors are either abelian or isomorphic to some fixed non-abelian simple group . For a large class of non-abelian simple groups , we prove that the prime graph complements of -solvable groups are always realizable by a solvable group and a quasi simple or almost simple -solvable group acting by automorphisms on a direct product of elementary abelian groups. We conjecture that a similar result holds in full generality. Moreover, we apply our result to classify in purely graph-theoretic terms the prime graph complements of -solvable groups, and indicate other interesting classes of groups matching the assumptions of our main theorem.
Paper Prompts
Sign up for free to create and run prompts on this paper.