Avoiding long Berge cycles, the missing cases $k=r+1$ and $k=r+2$

Beka Ergemlidze, Ervin Győri, Abhishek Methuku +3

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 Füredi, Kostochka and Luo and for $k<r$ (and $…