Optimal packings of Hamilton cycles in sparse random graphs
classification
🧮 math.CO
keywords
cyclesepsilonhamiltonrandomalmostasymptoticallycollectionconstant
pith:XI2EIAUT Add to your LaTeX paper
What is a Pith Number?\usepackage{pith}
\pithnumber{XI2EIAUT}
Prints a linked pith:XI2EIAUT badge after your title and writes the identifier into PDF metadata. Compiles on arXiv with no extra files. Learn more
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.