Optimal packings of Hamilton cycles in sparse random graphs
Abstract
We prove that there exists a positive constant ε such that if 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.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.