The Gruenberg-Kegel graph of finite solvable rational groups
Sara C. Deb\'on, Diego Garc\'ia-Lucas, \'Angel del R\'io

TL;DR
This paper classifies the Gruenberg-Kegel graphs of finite solvable rational groups, completing previous work and providing a comprehensive understanding of their prime graph structures.
Contribution
It completes the classification of Gruenberg-Kegel graphs for finite solvable rational groups, advancing the understanding of their structure.
Findings
Complete classification of Gruenberg-Kegel graphs for these groups
Identification of possible prime graph configurations
Extension of previous partial results
Abstract
A finite group is said to be rational if every character of is rational-valued. The Gruenberg-Kegel graph of a finite group is the undirected graph whose vertices are the primes dividing the order of and the edges join different primes and whenever contains an element of order . In this paper, we complete the classification of the Gruenberg-Kegel graphs of finite solvable rational groups initiated in \cite{BKMdR}.
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.
Taxonomy
TopicsFinite Group Theory Research · Synthesis and properties of polymers · Graph theory and applications
