Kronecker classes and cliques in derangement graphs
Marina Cazzola, Louis Gogniat, Pablo Spiga

TL;DR
This paper investigates derangement graphs of permutation groups, proving the existence of large cliques in transitive groups of degree over 30, and explores implications for subgroup indices related to a conjecture on Kronecker classes.
Contribution
It establishes the presence of 4-cliques in derangement graphs of large transitive groups and derives bounds on subgroup indices supporting a conjecture on Kronecker classes.
Findings
Derangement graphs of transitive groups with degree > 30 contain 4-cliques.
If G is a normal subgroup with index 3 in A, then certain subgroup index bounds hold.
Supports a conjecture by Neumann and Praeger on Kronecker classes.
Abstract
Given a permutation group , the derangement graph of is defined with vertex set , where two elements and are adjacent if and only if is a derangement. We establish that, if is transitive with degree exceeding 30, then the derangement graph of contains a complete subgraph with four vertices. As a consequence, if is a normal subgroup of such that , and if is a subgroup of satisfying , then . This result provides support for a conjecture by Neumann and Praeger concerning Kronecker classes.
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.
