Optimal packings of Hamilton cycles in sparse random graphs
Combinatorics
2011-09-27 v1
Abstract
We prove that there exists a positive constant \epsilon such that if \log n / n \le p \le n^{-1+\epsilon}, then asymptotically almost surely the random graph G ~ G(n,p) contains a collection of \lfloor \delta(G)/2 \rfloor edge-disjoint Hamilton cycles.
Keywords
Cite
@article{arxiv.1109.5341,
title = {Optimal packings of Hamilton cycles in sparse random graphs},
author = {Michael Krivelevich and Wojciech Samotij},
journal= {arXiv preprint arXiv:1109.5341},
year = {2011}
}
Comments
19 pages