@article{56778f52a0114307a44c8d50d609dcf7,
title = "Optimal packings of Hamilton cycles in sparse random graphs",
abstract = "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.",
keywords = "Hamilton cycle, Packing, Random graph",
author = "Michael Krivelevich and Wojciech Samotij",
year = "2012",
doi = "10.1137/110849171",
language = "אנגלית",
volume = "26",
pages = "964--982",
journal = "SIAM Journal on Discrete Mathematics",
issn = "0895-4801",
publisher = "Society for Industrial and Applied Mathematics (SIAM)",
number = "3",
}