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

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\"uredi, Kostochka and Luo and for $k<r$ (and $k=r$, asymptotically) by Kostochka and Luo. In this paper, we settle the remaining cases: $k=r+1$ and $k=r+2$, proving a conjecture of F\"uredi, Kostochka and Luo.