Packing Loose Hamilton Cycles

DOI10.1017/S0963548317000402zbMath1373.05176arXiv1608.01278MaRDI QIDQ5373831

Asaf Ferber, Kyle Luh, Daniel Montealegre, Oanh Nguyen

Publication date: 27 October 2017

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Hypergraphs (05C65)

Cites Work

• Unnamed Item
• Loose Hamilton cycles in random uniform hypergraphs
• Loose Hamilton cycles in random 3-uniform hypergraphs
• On packing Hamilton cycles in \(\varepsilon\)-regular graphs
• Optimal divisibility conditions for loose Hamilton cycles in random hypergraphs
• Closing gaps in problems related to Hamilton cycles in random graphs and hypergraphs
• Packing hamilton cycles in random and pseudo-random hypergraphs
• Packing perfect matchings in random hypergraphs
• Optimal Packings of Hamilton Cycles in Sparse Random Graphs
• Edge-disjoint Hamilton cycles in random graphs
• Packing, counting and covering Hamilton cycles in random directed graphs

This page was built for publication: Packing Loose Hamilton Cycles