Kronecker classes and cliques in derangement graphs

Fuente: arXiv
Guardado en:
Detalles Bibliográficos
Autores principales: Cazzola, Marina, Gogniat, Louis, Spiga, Pablo
Formato: Preprint
Publicado: 2025
Materias:
Acceso en línea:
Etiquetas: Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
_version_ 1866913030382551040
author Cazzola, Marina
Gogniat, Louis
Spiga, Pablo
author_facet Cazzola, Marina
Gogniat, Louis
Spiga, Pablo
contents Given a permutation group $G$, the derangement graph of $G$ is defined with vertex set $G$, where two elements $x$ and $y$ are adjacent if and only if $xy^{-1}$ is a derangement. We establish that, if $G$ is transitive with degree exceeding 30, then the derangement graph of $G$ contains a complete subgraph with four vertices. As a consequence, if $G$ is a normal subgroup of $A$ such that $|A : G| = 3$, and if $U$ is a subgroup of $G$ satisfying $G = \bigcup_{a \in A} U^a$, then $|G : U| \leq 10$. This result provides support for a conjecture by Neumann and Praeger concerning Kronecker classes.
format Preprint
id arxiv_https___arxiv_org_abs_2502_01287
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle Kronecker classes and cliques in derangement graphs
Cazzola, Marina
Gogniat, Louis
Spiga, Pablo
Combinatorics
Group Theory
Given a permutation group $G$, the derangement graph of $G$ is defined with vertex set $G$, where two elements $x$ and $y$ are adjacent if and only if $xy^{-1}$ is a derangement. We establish that, if $G$ is transitive with degree exceeding 30, then the derangement graph of $G$ contains a complete subgraph with four vertices. As a consequence, if $G$ is a normal subgroup of $A$ such that $|A : G| = 3$, and if $U$ is a subgroup of $G$ satisfying $G = \bigcup_{a \in A} U^a$, then $|G : U| \leq 10$. This result provides support for a conjecture by Neumann and Praeger concerning Kronecker classes.
title Kronecker classes and cliques in derangement graphs
topic Combinatorics
Group Theory
url https://arxiv.org/abs/2502.01287