Sharp thresholds for nonlinear Hamiltonian cycles in hypergraphs

DOI10.1002/rsa.20919zbMath1472.05088arXiv1906.05142OpenAlexW3008186501MaRDI QIDQ5120748

Mathias Schacht, Bhargav P. Narayanan

Publication date: 16 September 2020

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

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

zbMATH Keywords

thresholdshypergraphsHamilton cycles

Mathematics Subject Classification ID

Hypergraphs (05C65) Eulerian and Hamiltonian graphs (05C45)

Related Items (3)

On powers of tight Hamilton cycles in randomly perturbed hypergraphs ⋮ Longest Paths in Random Hypergraphs ⋮ The threshold for the square of a Hamilton cycle

Cites Work

• Unnamed Item
• Unnamed Item
• Loose Hamilton cycles in random uniform hypergraphs
• Loose Hamilton cycles in random 3-uniform hypergraphs
• Limit distribution for the existence of Hamiltonian cycles in a random graph
• Threshold functions
• Hamiltonian circuits in random graphs
• Factors in random graphs
• Sharp thresholds of graph properties, and the $k$-sat problem
• Spanning Subgraphs of Random Graphs
• Hunting for sharp thresholds
• Tight Hamilton cycles in random uniform hypergraphs

This page was built for publication: Sharp thresholds for nonlinear Hamiltonian cycles in hypergraphs