Edge-disjoint Hamilton cycles in random graphs
We show that provided we can with high probability find a collection of edge-disjoint Hamilton cycles in , plus an additional edge-disjoint matching of size if is odd. This is clearly optimal and confirms, for the above range of p, a conjecture of Frieze and Krivelevich.  2013 Wiley Periodicals, Inc. Random Struct. Alg., 46, 397445, 2015
hamilton cycles random graphs packings