@article {IOPORT.06012627,
    author       = {Knox, Fiachra and K\"uhn, Daniela and Osthus, Deryk},
    title        = {Approximate Hamilton decompositions of random graphs.},
    year         = {2012},
    journal      = {Random Structures \& Algorithms},
    volume       = {40},
    number       = {2},
    issn         = {1042-9832},
    pages        = {133-149},
    publisher    = {John Wiley \& Sons, Inc., New York, NY},
    doi          = {10.1002/rsa.20365},
    abstract     = {Summary: We show that if $pn \gg \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 \gg \log n$ is necessary.},
    identifier   = {06012627},
}