Abelian covers of alternating groups
Daniel Barrantes, Nick Gill, Jerem\'ias Ram\'irez

TL;DR
This paper investigates the properties of the commuting graph of alternating groups, specifically analyzing the relationship between independence number and clique-covering number for most values of n.
Contribution
It provides a comprehensive analysis of the commuting graph of alternating groups, identifying cases where the independence number equals the clique-covering number, excluding specific values of n.
Findings
For all n except 13, 14, 17, and 19, the independence number equals the clique-covering number in the commuting graph of A_n.
The paper characterizes the structure of the commuting graph for alternating groups.
It highlights the exceptional cases where the equality does not hold.
Abstract
Let , a finite alternating group. We study the commuting graph of and establish, for all possible values of barring and , whether or not the independence number is equal to the clique-covering number.
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.
