Packing and counting arbitrary Hamilton cycles in random digraphs

Asaf Ferber, Eoin Long

We prove packing and counting theorems for arbitrarily oriented Hamilton cycles in $\mathcal{D}(n,p)$ for nearly optimal $p$ (up to a ${\log }^{c}n$ factor). In particular, we show that g…