P\'osa-type results for Berge-hypergraphs
Combinatorics
2024-03-14 v3
Abstract
A Berge cycle of length in a hypergraph is a sequence of distinct vertices and hyperedges such that for all , indices taken modulo . 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 -uniform and non-uniform hypergraphs that force Hamiltonian Berge cycles.
Keywords
Cite
@article{arxiv.2111.06710,
title = {P\'osa-type results for Berge-hypergraphs},
author = {Nika Salia},
journal= {arXiv preprint arXiv:2111.06710},
year = {2024}
}