Edge‐disjoint Hamilton cycles in random graphs1. Issue 3 (2nd July 2013) - Knox, Fiachra
Abstract We show that provided log50n/n≤p≤1−n−1/4log9n we can with high probability find a collection of ⌊δ(G)/2⌋ edge‐disjoint Hamilton cycles in G∼Gn, p, plus an additional edge‐disjoint matching of size ⌊n/2⌋ if δ(G) 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, 397–445, 2015