Packing Tight Hamilton Cycles in Uniform Hypergraphs

DOI10.1137/11082378XzbMath1248.05104arXiv1102.1488OpenAlexW1976828176WikidataQ57401440 ScholiaQ57401440MaRDI QIDQ2910924

Deepak Bal, Alan M. Frieze

Publication date: 12 September 2012

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

random hypergraphs\((\epsilon,p)\)-regular hypergraphs

Mathematics Subject Classification ID

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

Related Items (11)

Decompositions of quasirandom hypergraphs into hypergraphs of bounded degree ⋮ Packing hamilton cycles in random and pseudo-random hypergraphs ⋮ Euler tours in hypergraphs ⋮ Packing tree factors in random and pseudo-random graphs ⋮ Graph and hypergraph packing ⋮ Recent advances on the Hamiltonian problem: survey III ⋮ Decompositions of complete uniform hypergraphs into Hamilton Berge cycles ⋮ Hamilton cycles in quasirandom hypergraphs ⋮ Edge-disjoint Hamilton cycles in random graphs ⋮ Tight Hamilton cycles in random hypergraphs ⋮ Decomposing hypergraphs into cycle factors

This page was built for publication: Packing Tight Hamilton Cycles in Uniform Hypergraphs