@article {IOPORT.06074025,
    author       = {Frieze, Alan and Krivelevich, Michael},
    title        = {Packing Hamilton cycles in random and pseudo-random hypergraphs.},
    year         = {2012},
    journal      = {Random Structures \& Algorithms},
    volume       = {41},
    number       = {1},
    issn         = {1042-9832},
    pages        = {1-22},
    publisher    = {John Wiley \& Sons, Inc., New York, NY},
    doi          = {10.1002/rsa.20396},
    abstract     = {Summary: We say that a $k$-uniform hypergraph $C$ is a Hamilton cycle of type $\ell $, for some $1 \le \ell \le k$, if there exists a cyclic ordering of the vertices of $C$ such that every edge consists of $k$ consecutive vertices and for every pair of consecutive edges $E_{i-1},E_{i}$ in $C$ (in the natural ordering of the edges) we have $|E_{i-1} \backslash E_{i}| = \ell $. We prove that for $k/2 < \ell \le k$, with high probability almost all edges of the random $k$-uniform hypergraph $H(n,p,k)$ with $p(n) \gg \log ^{2}n/n$ can be decomposed into edge-disjoint type $\ell $ Hamilton cycles. A slightly weaker result is given for $\ell = k/2$. We also provide sufficient conditions for decomposing almost all edges of a pseudo-random $k$-uniform hypergraph into type $\ell $ Hamilton cycles, for $k/2 \le \ell \le k$. For the case $\ell = k$ these results show that almost all edges of corresponding random and pseudo-random hypergraphs can be packed with disjoint perfect matchings.},
    identifier   = {06074025},
}