A Dirac-type theorem for Berge cycles in random hypergraphs

DOI10.37236/8611zbMATH Open1466.05194OpenAlexW3083082155MaRDI QIDQ2194091FDOQ2194091

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

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

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)

Cites Work

• A Dirac-Type Theorem for 3-Uniform Hypergraphs
• Rainbow matchings in Dirac bipartite graphs
• Some Theorems on Abstract Graphs
• Dirac's theorem for random graphs
• Bandwidth theorem for random graphs
• Hamilton cycles in graphs and hypergraphs: an extremal perspective
• 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
• Title not available (Why is that?)
• Local resilience of graphs
• Resilient Pancyclicity of Random and Pseudorandom Graphs
• Title not available (Why is that?)
• A Dirac-type theorem for Hamilton Berge cycles in random hypergraphs
• The Bandwidth Theorem in sparse graphs
• Co-degrees resilience for perfect matchings in random hypergraphs
• Hamiltonicity in random graphs is born resilient
• Robust Hamiltonicity of random directed graphs
• Local resilience of an almost spanning k‐cycle in random graphs
• Resilience of perfect matchings and Hamiltonicity in random graph processes
• Random directed graphs are robustly Hamiltonian

Cited In (8)

• Dirac-type theorems for long Berge cycles in hypergraphs
• Dirac-type theorems in random 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
• What Are Higher-Order Networks?
• Minimum degree ensuring that a hypergraph is Hamiltonian-connected

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)