Loose Hamilton Cycles in Regular Hypergraphs

DOI10.1017/S0963548314000406zbMath1371.05201arXiv1304.1426WikidataQ57401412 ScholiaQ57401412MaRDI QIDQ5364219

Andrzej Dudek, Andrzej Ruciński, Matas Šileikis, Alan M. Frieze

Publication date: 4 October 2017

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

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

Mathematics Subject Classification ID

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

Related Items

Embedding the Erdős-Rényi hypergraph into the random regular hypergraph and Hamiltonicity, A threshold result for loose Hamiltonicity in random regular uniform hypergraphs, Edge Correlations in Random Regular Hypergraphs and Applications to Subgraph Testing

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Loose Hamilton cycles in random uniform hypergraphs
• Loose Hamilton cycles in random 3-uniform hypergraphs
• A probabilistic proof of an asymptotic formula for the number of labelled regular graphs
• The asymptotic number of labeled graphs with given degree sequences
• Sandwiching random graphs: universality between random graph models
• Optimal divisibility conditions for loose Hamilton cycles in random hypergraphs
• Approximate counting of regular hypergraphs
• Random regular graphs of high degree
• Random Regular Graphs of Non-Constant Degree: Connectivity and Hamiltonicity
• Almost all graphs with 1.44n edges are 3-colorable
• Uniform generation of random regular graphs of moderate degree
• Almost all cubic graphs are Hamiltonian
• Almost all regular graphs are hamiltonian
• Tight Hamilton cycles in random uniform hypergraphs