P\'osa-type results for Berge-hypergraphs
Abstract
A Berge cycle of length k in a hypergraph 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\"uredi, 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\'osa-type lower bound for r-uniform and non-uniform hypergraphs that force Hamiltonian Berge cycles.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.