The Structure of Hypergraphs without long Berge cycles
Combinatorics
2019-07-12 v2
Abstract
We study the structure of -uniform hypergraphs containing no Berge cycles of length at least for , and determine that such hypergraphs have some special substructure. In particular we determine the extremal number of such hypergraphs, giving an affirmative answer to the conjectured value when and giving a a simple solution to a recent result of Kostochka-Luo when .
Keywords
Cite
@article{arxiv.1812.10737,
title = {The Structure of Hypergraphs without long Berge cycles},
author = {Ervin Győri and Nathan Lemons and Nika Salia and Oscar Zamora},
journal= {arXiv preprint arXiv:1812.10737},
year = {2019}
}
Comments
9 pages, 2 figures