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

In a hypergraph \(H\) an alternating sequence of distinct vertices and edges \(v_1, e_2, v_2, \ldots, e_c, v_1\) such that \(\{v_i, v_{i+1}\}\subseteq e_i\) for all \( i \)(with indices taken modulo \(c\)) is called a Berge cycle in \(H\). In this paper, the authors consider a hypergraph version of Dirac' s theorem for long cycles in 2-connected graphs and prove that for \(n \geq k \geq r + 2 \geq 5\), every 2-connected \(r\)-uniform \(n\)-vertex hypergraph with minimum degree at least \(\binom{k-1}{r-1}+1\) has a Berge cycle of length at least \(\min\{2k, n\}\). The bound is sharp for all \(k \geq r + 2 \geq 5\).