Berge cycles in non-uniform hypergraphs
Combinatorics
2020-02-06 v1
Abstract
We consider two extremal problems for set systems without long Berge cycles. First we give Dirac-type minimum degree conditions that force long Berge cycles. Next we give an upper bound for the number of hyperedges in a hypergraph with bounded circumference. Both results are best possible in infinitely many cases.
Keywords
Cite
@article{arxiv.2002.01597,
title = {Berge cycles in non-uniform hypergraphs},
author = {Zoltan Furedi and Alexandr Kostochka and Ruth Luo},
journal= {arXiv preprint arXiv:2002.01597},
year = {2020}
}