Ergemlidze, BekaGyori, ErvinMethuku, AbhishekSalia, NikaTompkins, CaseyZamora, Oscar2020-10-292020-10-292020-10-292020-05-0110.1017/S0963548319000415https://infoscience.epfl.ch/handle/20.500.14299/172871WOS:000577595100003The maximum size of anr-uniform hypergraph without a Berge cycle of length at leastkhas been determined for allk >= r+ 3 by Furedi, Kostochka and Luo and fork<r(andk=r, asymptotically) by Kostochka and Luo. In this paper we settle the remaining cases:k=r+ 1 andk=r+ 2, proving a conjecture of Furedi, Kostochka and Luo.Computer Science, Theory & MethodsMathematicsStatistics & ProbabilityComputer Science05c6505d99Avoiding long Berge cycles: the missing casesk=r+1 andk=r+2text::journal::journal article::research article