2018/12/27 by Győri, Ervin, Lemons, Nathan, Salia, Nika +1 · 1 citation
#Combinatorics (math.CO) #FOS: Mathematics
paper · doi:10.48550/arxiv.1812.10737
We study the structure of r-uniform hypergraphs containing no Berge cycles of length at least k for k ≤ r, 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 k=r and giving a a simple solution to a recent result of Kostochka-Luo when k < r.