Cycle-factors of regular graphs via entropy

Micha Christoph, Nemanja Draganić, António Girão +3

It is a classical result that a random permutation of $n$ elements has, on average, about $\log n$ cycles. We generalise this fact to all directed $d$-regular graphs on $n$ vertice…