On Independence Number of Comaximal Subgroup Graph
Angsuman Das, Arnab Mandal

TL;DR
This paper establishes specific thresholds on the independence number of the comaximal subgroup graph that determine whether a finite group is solvable, supersolvable, or nilpotent, with some exceptions and open problems.
Contribution
It provides sharp bounds on the independence number of the comaximal subgroup graph that guarantee certain group properties, identifying unique cases and exceptions.
Findings
Groups with independence number ≤ 51 are solvable.
Groups with independence number ≤ 14 are supersolvable, with three exceptions.
Groups with independence number ≤ 6 are nilpotent, with five exceptions.
Abstract
In this paper, we establish sharp thresholds on the independence number of the comaximal subgroup graph that guarantee solvability, supersolvability, and nilpotency of the underlying group . Specifically: \begin{itemize} \item For solvability, we prove that any group with independence number must be solvable, and show that the alternating group is uniquely determined by its graph. \item For supersolvability, we show that implies is supersolvable, except for three explicit exceptions. \item For nilpotency, we prove that ensures nilpotency, except for five groups. \end{itemize} Finally, we conclude with some open issues involving domination parameters.
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 · Advanced Graph Theory Research · Geometric and Algebraic Topology
