Generating infinite digraphs by derangements

Daniel Horsley, Moharram Iradmusa, Cheryl E. Praeger

A set $\mathcal{S}$ of derangements (fixed-point-free permutations) of a set $V$ generates a digraph with vertex set $V$ and arcs $(x,x^{\sigma })$ for $x\in V$ and $\sigma \in \mathcal{S}$. We a…