2021/11/12 by Salia, Nika · 1 citation
#Combinatorics (math.CO) #FOS: Mathematics
paper · doi:10.48550/arxiv.2111.06710
A Berge cycle of length k in a hypergraph \mathcal H is a sequence of distinct vertices and hyperedges v1,h1,v2,h2,…,vk,hk such that vi,vi+1∈ hi for all i∈[k], indices taken modulo k. Füredi, Kostochka and Luo recently gave sharp Dirac-type minimum degree conditions that force non-uniform hypergraphs to have Hamiltonian Berge cycles. We give a sharp Pósa-type lower bound for r-uniform and non-uniform hypergraphs that force Hamiltonian Berge cycles.