Nika Salia: Avoiding Long Berge Cycle

The maximum size of an r-uniform hypergraph without a Berge cycle of length at least k has been determined for all $k\ge r+3$ by Furedi, Kostochka and Luo and for k<r  by Kostochka and Luo. In this paper, we settle the remaining cases: $k=r+1$ and $k=r+2$, proving a conjecture of Furedi, Kostochka and Luo.

Joint with Beka Ergemlidze, Ervin Győri, Abhishek Methuku, Casey Tompkins, Oscar Zamora