A Dirac-type theorem for Berge cycles in random hypergraphs

DOI10.37236/8611zbMath1466.05194OpenAlexW3083082155MaRDI QIDQ2194091

Yury Person, Dennis Clemens, Julia Ehrenmüller

Publication date: 25 August 2020

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.37236/8611

zbMATH Keywords

Hamilton Berge cyclelocal resilience

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Hypergraphs (05C65) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)

Related Items (3)

Dirac-type theorems in random hypergraphs ⋮ Minimum degree ensuring that a hypergraph is Hamiltonian-connected ⋮ What Are Higher-Order Networks?

Cites Work

• Unnamed Item
• Unnamed Item
• A Dirac-type theorem for Hamilton Berge cycles in random hypergraphs
• Bandwidth theorem for random graphs
• Co-degrees resilience for perfect matchings in random hypergraphs
• Hamiltonicity in random graphs is born resilient
• Robust Hamiltonicity of random directed graphs
• Random directed graphs are robustly Hamiltonian
• Almost spanning subgraphs of random graphs after adversarial edge removal
• Corrádi and Hajnal's Theorem for Sparse Random Graphs
• Local resilience of almost spanning trees in random graphs
• Resilient Pancyclicity of Random and Pseudorandom Graphs
• Dirac's theorem for random graphs
• A Dirac-Type Theorem for 3-Uniform Hypergraphs
• Local resilience of graphs
• Hamilton cycles in graphs and hypergraphs: an extremal perspective
• Local resilience of an almost spanning k‐cycle in random graphs
• The Bandwidth Theorem in sparse graphs
• Resilience of perfect matchings and Hamiltonicity in random graph processes
• Rainbow matchings in Dirac bipartite graphs
• Some Theorems on Abstract Graphs

This page was built for publication: A Dirac-type theorem for Berge cycles in random hypergraphs