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

MaRDI QIDQ6508280arXivFDO

Authors Alexandr Kostochka, Ruth Luo, Grace McCourt

Mathematics Subject Classification ID

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

Abstract: Dirac proved that each $n$-vertex $2$-connected graph with minimum degree at least $k$ contains a cycle of length at least $min2k,n$. We prove a hypergraph version of this result: for $ngeqkgeqr+2geq5$, every $2$-connected $r$-uniform $n$-vertex hypergraph with minimum degree at least $k-1chooser-1+1$ has a Berge cycle of length at least $min2k,n$. The bound is exact for all $kgeqr+2geq5$.

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 Q6508280)