Kronecker classes and cliques in derangement graphs

Marina Cazzola, Louis Gogniat, Pablo Spiga

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 $x{y}^{-1}$ is a derangement. W…