At most how many edge-disjoint Hamilton cycles does the directed random graph
contain?
It is easy to see that one cannot pack more than the minimum in-degree or the minimum out-degree of the digraph. In this talk I will discuss a recent result that shows that this trivial upper bound is in fact sharp for D(n,p), if p is slightly larger than the Hamiltonicity threshold.

Based on a joint work with Asaf Ferber.