Longest Paths in Random Hypergraphs

DOI10.1137/20M1345712zbMath1477.05169arXiv2003.14143OpenAlexW3205740532MaRDI QIDQ5163510

Mihyun Kang, Nicolás Sanhueza-Matamala, Eng Keat Hng, Oliver Cooley, Julian Zalla, Frederik Garbe

Publication date: 4 November 2021

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

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

zbMATH Keywords

pathsphase transitionsearch algorithmrandom hypergraphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Random graphs (graph-theoretic aspects) (05C80) Hypergraphs (05C65) Paths and cycles (05C38) Distance in graphs (05C12) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items

Loose cores and cycles in random hypergraphs

Cites Work

• Unnamed Item
• Unnamed Item
• Tight cycles and regular slices in dense hypergraphs
• Loose Hamilton cycles in random uniform hypergraphs
• Hypergraph extensions of the Erdős-Gallai theorem
• Component structure in the evolution of random hypergraphs
• The longest path in a random graph
• A scaling limit for the length of the longest cycle in a sparse random graph
• A survey of hypergraph Ramsey problems
• The phase transition in random graphs: A simple proof
• Recent advances on Dirac-type problems for hypergraphs
• A Random Graph With a Subcritical Number of Edges
• Cycles in a random graph near the critical point
• Hamilton cycles in graphs and hypergraphs: an extremal perspective
• The size of the giant high‐order component in random hypergraphs
• Tight Hamilton cycles in random uniform hypergraphs
• Largest Components in Random Hypergraphs
• Sharp thresholds for nonlinear Hamiltonian cycles in hypergraphs
• An Improved Upper Bound on the Length of the Longest Cycle of a Supercritical Random Graph