A hypergraph analog of Dirac's theorem for long cycles in 2-connected graphs

DOI10.1007/S00493-024-00096-1MaRDI QIDQ6607841zbMATH OpenFDO

Authors Alexandr Kostochka, Ruth Luo, Grace McCourt

Publication date 19 September 2024

Published in Combinatorica (Search for Journal in Brave)

zbMATH Keywords

minimum degreeextremal hypergraph theoryBerge cycles

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38) Hypergraphs (05C65) Extremal set theory (05D05)

Recommendations

• Dirac-type theorems for long Berge cycles in hypergraphs
• A Dirac-type theorem for uniform hypergraphs
• Longest cycles in 3‐connected hypergraphs and bipartite graphs
• On 2-connected hypergraphs with no long cycles

Cited in

(3)

• On a property of 2-connected graphs and Dirac's theorem
• A Dirac-type theorem for uniform hypergraphs
• Dirac-type theorems for long Berge cycles in hypergraphs

This page was built for publication: A hypergraph analog of Dirac's theorem for long cycles in 2-connected graphs

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