A Dirac-type theorem for Berge cycles in random hypergraphs

DOI10.37236/8611MaRDI QIDQ2194091zbMATH OpenOpenAlexFDO

Authors Dennis Clemens, Julia Ehrenmüller, Yury Person

Publication date 25 August 2020

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

Copyright license Creative Commons Attribution 4.0 International

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)

Recommendations

• A Dirac-type theorem for Hamilton Berge cycles in random hypergraphs
• Hamiltonian Berge cycles in random hypergraphs
• A Dirac-Type Theorem for 3-Uniform Hypergraphs
• Berge cycles in non-uniform hypergraphs
• Tight Hamilton cycles in random hypergraphs

Cites work

• scientific article; zbMATH DE number 3641483 (Why is no real title available?)
• A Dirac-Type Theorem for 3-Uniform Hypergraphs
• 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
• Corrádi and Hajnal's theorem for sparse random graphs
• Dirac's theorem for random graphs
• Dirac-type questions for hypergraphs -- a survey (or more problems for Endre to solve)
• Hamilton cycles in graphs and hypergraphs: an extremal perspective
• Hamiltonicity in random graphs is born resilient
• Local resilience of almost spanning trees in random graphs
• Local resilience of an almost spanning k‐cycle in random graphs
• Local resilience of graphs
• Rainbow matchings in Dirac bipartite graphs
• Random directed graphs are robustly Hamiltonian
• Resilience of perfect matchings and Hamiltonicity in random graph processes
• Resilient pancyclicity of random and pseudorandom graphs
• Robust Hamiltonicity of random directed graphs
• Some Theorems on Abstract Graphs
• The bandwidth theorem in sparse graphs

Cited in

(12)

• Dirac-type theorems for long Berge cycles in hypergraphs
• Dirac-type theorems in random hypergraphs
• Hamiltonian Berge cycles in random hypergraphs
• Pósa-type results for Berge hypergraphs
• A Dirac-type theorem for uniform hypergraphs
• Longest cycles in 3‐connected hypergraphs and bipartite graphs
• Transference for loose Hamilton cycles in random 3-uniform hypergraphs
• Resilience for tight Hamiltonicity
• Optimal spread for spanning subgraphs of Dirac hypergraphs
• What Are Higher-Order Networks?
• Minimum degree ensuring that a hypergraph is Hamiltonian-connected
• A Dirac-type theorem for Hamilton Berge cycles in random hypergraphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2194091)