Disconnected Cliques in Derangement Graphs

Sara Anderson, W. Riley Casper, Sam Fleyshman +1

We obtain a correspondence between pairs of $N\times N$ orthogonal Latin squares and pairs of disconnected maximal cliques in the derangement graph with $N$ symbols. Motivated by m…