Avoiding long Berge cycles, the missing cases $k=r+1$ and $k = r+2$
Combinatorics
2018-08-24 v1
Abstract
The maximum size of an -uniform hypergraph without a Berge cycle of length at least has been determined for all by F\"uredi, Kostochka and Luo and for (and , asymptotically) by Kostochka and Luo. In this paper, we settle the remaining cases: and , proving a conjecture of F\"uredi, Kostochka and Luo.
Keywords
Cite
@article{arxiv.1808.07687,
title = {Avoiding long Berge cycles, the missing cases $k=r+1$ and $k = r+2$},
author = {Beka Ergemlidze and Ervin Győri and Abhishek Methuku and Nika Salia and Casey Tompkins and Oscar Zamora},
journal= {arXiv preprint arXiv:1808.07687},
year = {2018}
}