Optimal packings of Hamilton cycles in sparse random graphs

Michael Krivelevich; Wojciech Samotij

doi:10.1137/110849171

Optimal packings of Hamilton cycles in sparse random graphs

Michael Krivelevich, Wojciech Samotij

School of Mathematical Sciences

Research output: Contribution to journal › Article › peer-review

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.

Original language	English
Pages (from-to)	964-982
Number of pages	19
Journal	SIAM Journal on Discrete Mathematics
Volume	26
Issue number	3
DOIs	https://doi.org/10.1137/110849171
State	Published - 2012

Keywords

Hamilton cycle
Packing
Random graph

Access to Document

10.1137/110849171

Cite this

@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",

}

TY - JOUR

T1 - Optimal packings of Hamilton cycles in sparse random graphs

AU - Krivelevich, Michael

AU - Samotij, Wojciech

PY - 2012

Y1 - 2012

N2 - 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.

AB - 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.

KW - Hamilton cycle

KW - Packing

KW - Random graph

UR - http://www.scopus.com/inward/record.url?scp=84867318119&partnerID=8YFLogxK

U2 - 10.1137/110849171

DO - 10.1137/110849171

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:84867318119

VL - 26

SP - 964

EP - 982

JO - SIAM Journal on Discrete Mathematics

JF - SIAM Journal on Discrete Mathematics

SN - 0895-4801

IS - 3

ER -

Optimal packings of Hamilton cycles in sparse random graphs

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this