Packing hamilton cycles in random and pseudo-random hypergraphs

DOI10.1002/rsa.20396zbMath1247.05126arXiv1003.1958OpenAlexW2119368576WikidataQ57401441 ScholiaQ57401441MaRDI QIDQ2909240

Michael Krivelevich, Alan M. Frieze

Publication date: 30 August 2012

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

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

zbMATH Keywords

packingHamilton cyclespseudo-randomrandom hypergraphs

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Eulerian and Hamiltonian graphs (05C45)

Related Items (18)

Packing tight Hamilton cycles in 3-uniform hypergraphs ⋮ Decompositions of quasirandom hypergraphs into hypergraphs of bounded degree ⋮ Weak and strong versions of the 1-2-3 conjecture for uniform hypergraphs ⋮ A counting lemma for sparse pseudorandom hypergraphs ⋮ On rainbow Hamilton cycles in random hypergraphs ⋮ Counting results for sparse pseudorandom hypergraphs. I. ⋮ Euler tours in hypergraphs ⋮ Packing tree factors in random and pseudo-random graphs ⋮ Packing Loose Hamilton Cycles ⋮ Almost all Steiner triple systems are almost resolvable ⋮ Decompositions of complete uniform hypergraphs into Hamilton Berge cycles ⋮ Rainbow hamilton cycles in random graphs ⋮ Hamilton cycles in quasirandom hypergraphs ⋮ Pseudorandom hypergraph matchings ⋮ Approximate Hamilton decompositions of random graphs ⋮ Edge-disjoint Hamilton cycles in random graphs ⋮ Tight Hamilton cycles in random hypergraphs ⋮ Decomposing hypergraphs into cycle factors

Cites Work

• Loose Hamilton cycles in random uniform hypergraphs
• Loose Hamilton cycles in hypergraphs
• Hamiltonian decompositions of complete \(k\)-uniform hypergraphs
• An approximate Dirac-type theorem for \(k\)-uniform hypergraphs
• 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
• On packing Hamilton cycles in \(\varepsilon\)-regular graphs
• Packing Tight Hamilton Cycles in Uniform Hypergraphs
• Factors in random graphs
• Tight Hamilton cycles in random uniform hypergraphs
• The Game of JumbleG
• Quasi-random graphs
• Unnamed Item

This page was built for publication: Packing hamilton cycles in random and pseudo-random hypergraphs