Optimal packings of Hamilton cycles in sparse random graphs

Michael Krivelevich; Wojciech Samotij

REVIEW

Optimal packings of Hamilton cycles in sparse random graphs

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1109.5341 v1 pith:XI2EIAUT submitted 2011-09-25 math.CO

Optimal packings of Hamilton cycles in sparse random graphs

Michael Krivelevich , Wojciech Samotij This is my paper

classification math.CO

keywords cyclesepsilonhamiltonrandomalmostasymptoticallycollectionconstant

verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved

0 comments

Share X Bluesky LinkedIn Reddit HN

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.

Optimal packings of Hamilton cycles in sparse random graphs

discussion (0)