Approximate Hamilton decompositions of random graphs

Authors:
Fiachra Knox;Daniela Kühn;Deryk Osthus
Affiliations:
School of Mathematics, University of Birmingham, Edgbaston, Birmingham, B15 2TT, UK;School of Mathematics, University of Birmingham, Edgbaston, Birmingham, B15 2TT, UK;School of Mathematics, University of Birmingham, Edgbaston, Birmingham, B15 2TT, UK
Venue:
Random Structures & Algorithms
Year:
2012

Citing 3
Cited 3

Random matchings which induce Hamilton cycles and Hamiltonian decompositions of random regular graphs

Journal of Combinatorial Theory Series B
On packing Hamilton cycles in ε-regular graphs

Journal of Combinatorial Theory Series B
Sparse pseudo-random graphs are Hamiltonian

Journal of Graph Theory

Packing tight Hamilton cycles in 3-uniform hypergraphs

Random Structures & Algorithms
On prisms, Möbius ladders and the cycle space of dense graphs

European Journal of Combinatorics
Hamilton decompositions of regular expanders: Applications

Journal of Combinatorial Theory Series B

Quantified Score

Hi-index	0.00

Visualization

Abstract

We show that if pn ≫ log n the binomial random graph Gn,p has an approximate Hamilton decomposition. More precisely, we show that in this range Gn,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. © 2011 Wiley Periodicals, Inc. Random Struct. Alg., 2012 © 2012 Wiley Periodicals, Inc.