Approximate Hamilton Decompositions of Random Graphs
Combinatorics
2013-07-05 v2
Abstract
We show that if pn >> log n, the binomial random graph G_{n,p} has an approximate Hamilton decomposition. More precisely, we show that in this range G_{n,p} contains a set of edge-disjoint Hamilton cycles covering almost all of its edges. This is best possible in the sense that the condition that pn >> log n is necessary.
Keywords
Cite
@article{arxiv.1006.1268,
title = {Approximate Hamilton Decompositions of Random Graphs},
author = {Fiachra Knox and Daniela Kühn and Deryk Osthus},
journal= {arXiv preprint arXiv:1006.1268},
year = {2013}
}
Comments
16 pages. This version incorporates comments from the referees