Optimal packings of Hamilton cycles in sparse random graphs

Abstract

We prove that there exists a positive constant εsuch that if \log n / n \le p \le n^{-1+ε}, then asymptotically almost surely the random graph G ~ G(n,p) contains a collection of \lfloor δ(G)/2 \rfloor edge-disjoint Hamilton cycles.

19 pages

References in corpus (2)

• Edge-disjoint Hamilton cycles in random graphs
• Approximate Hamilton Decompositions of Random Graphs