A hypergraph analog of Dirac's Theorem for long cycles in 2-connected graphs, II: Large uniformities

Alexandr Kostochka, Ruth Luo, Grace McCourt

Dirac proved that each $n$-vertex $2$-connected graph with minimum degree $k$ contains a cycle of length at least $\min \{2k,n\}$. We obtain analogous results for Berge cycles in h…