Packing tight Hamilton cycles in 3-uniform hypergraphs

DOI10.1002/rsa.20374zbMath1238.05184arXiv1005.4711OpenAlexW2046583195WikidataQ57401444 ScholiaQ57401444MaRDI QIDQ2884005

Michael Krivelevich, Po-Shen Loh, Alan M. Frieze

Publication date: 14 May 2012

Published in: Random Structures & Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1005.4711

zbMATH Keywords

packingrandom hypergraphstight Hamilton cycles

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Hypergraphs (05C65) Paths and cycles (05C38) Eulerian and Hamiltonian graphs (05C45)

Related Items (14)

Decompositions of quasirandom hypergraphs into hypergraphs of bounded degree ⋮ A counting lemma for sparse pseudorandom hypergraphs ⋮ Counting results for sparse pseudorandom hypergraphs. I. ⋮ Euler tours in hypergraphs ⋮ Factors and loose Hamilton cycles in sparse pseudo‐random hypergraphs ⋮ Packing tree factors in random and pseudo-random graphs ⋮ Regular uniform hypergraphs, \(s\)-cycles, \(s\)-paths and their largest Laplacian H-eigenvalues ⋮ Recent advances on the Hamiltonian problem: survey III ⋮ Decompositions of complete uniform hypergraphs into Hamilton Berge cycles ⋮ Rainbow hamilton cycles in random graphs ⋮ Hamilton cycles in quasirandom hypergraphs ⋮ Approximate Hamilton decompositions of random graphs ⋮ Edge-disjoint Hamilton cycles in random graphs ⋮ Tight Hamilton cycles in random hypergraphs

Cites Work

• Unnamed Item
• Unnamed Item
• Loose Hamilton cycles in hypergraphs
• Edge-disjoint Hamilton cycles in graphs
• On two Hamilton cycle problems in random graphs
• Dirac-type results for loose Hamilton cycles in uniform hypergraphs
• Loose Hamilton cycles in random 3-uniform hypergraphs
• Hamilton \(\ell \)-cycles in uniform hypergraphs
• Probabilistic methods for algorithmic discrete mathematics
• Hamilton decompositions of complete 3-uniform hypergraphs
• On packing Hamilton cycles in \(\varepsilon\)-regular graphs
• Random matchings which induce Hamilton cycles and Hamiltonian decompositions of random regular graphs
• Packing hamilton cycles in random and pseudo-random hypergraphs
• Hamilton decompositions of regular tournaments
• Sparse pseudo‐random graphs are Hamiltonian
• Some Theorems on Abstract Graphs
• Quasi-random graphs

This page was built for publication: Packing tight Hamilton cycles in 3-uniform hypergraphs