English

P\'osa-type results for Berge-hypergraphs

Combinatorics 2024-03-14 v3

Abstract

A Berge cycle of length kk in a hypergraph H\mathcal H is a sequence of distinct vertices and hyperedges v1,h1,v2,h2,,vk,hkv_1,h_1,v_2,h_2,\dots,v_{k},h_k such that vi,vi+1hiv_{i},v_{i+1}\in h_i for all i[k]i\in[k], indices taken modulo kk. 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 rr-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}
}
R2 v1 2026-06-24T07:36:17.611Z