The Prime Graphs of Some Classes of Finite Groups
Chris Florez, Jonathan Higgins, Kyle Huang, Thomas Michael Keller,, Dawei Shen, Yong Yang

TL;DR
This paper characterizes the prime graphs of various classes of finite groups, extending previous work and exploring connections to conjectures, with an algorithm to reconstruct prime graphs from dual graphs.
Contribution
It provides complete characterizations of prime graphs for several classes of finite groups, including square-free, metanilpotent, and cube-free groups, and introduces an algorithm for graph reconstruction.
Findings
Characterizations of prime graphs for specific group classes.
Connections to Maslova's conjecture.
An algorithm for prime graph reconstruction.
Abstract
In this paper we study prime graphs of finite groups. The prime graph of a finite group , also known as the Gruenberg-Kegel graph, is the graph with vertex set {primes dividing } and an edge - if and only if there exists an element of order in . In finite group theory, studying the prime graph of a group has been an important topic for the past almost half century. Only recently prime graphs of solvable groups have been characterized in graph theoretical terms only. In this paper, we continue this line of research and give complete characterizations of several classes of groups, including groups of square-free order, metanilpotent groups, groups of cube-free order, and, for any , solvable groups of -power-free order. We also explore the prime graphs of groups whose composition factors are cyclic or and draw connections to a…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
