We prove that there exists a positive constant ε such that if log n / n ≤ p ≤ n-1+ε, then asymptotically almost surely the random graph G ~ G(n,p) contains a collection of δ(G)/2 edge-disjoint Hamilton cycles.
No takes yet. Share an insight, caveat, or question.
Krivelevich et al. (2012) studied this question.
Synapse has enriched 3 closely related papers on similar clinical questions. Consider them for comparative context: