@article{d2c3b12da49b4f4ba354efbca4bc988d,
title = "Avoiding long Berge cycles II, exact bounds for all n",
abstract = "Let EGr (n, k) denote the maximum number of edges in an n-vertex r-uniform hypergraph with no Berge cycles of length k or longer. In the first part of this work [5], we have found exact values of EGr (n, k) and described the structure of extremal hypergraphs for the case when k − 2 divides n − 1andk ≥ r +3. In this paper we determine EGr (n, k) and describe the extremal hypergraphs for all n when k ≥ r +4.",
keywords = "Berge cycles, extremal hypergraph theory",
author = "Zolt{\'a}n F{\"u}redi and Alexandr Kostochka and Ruth Luo",
note = "Research supported in part by the Hungarian National Research, Development and Innovation Office NKFIH grant K116769, and by the Simons Foundation Collaboration Grant 317487. Research supported in part by NSF grant DMS-1600592 and grants 18-01 00353A and 16-01-00499 of the Russian Foundation for Basic Research. Research supported in part by Award RB17164 of the Research Board of the University of Illinois at Urbana-Champaign. arXiv: 1807.06119 \u2217Research supported in part by the Hungarian National Research, Development and Innovation Office NKFIH grant K116769, and by the Simons Foundation Collaboration Grant 317487. \u2020Research supported in part by NSF grant DMS-1600592 and grants 18-01-00353A and 16-01-00499 of the Russian Foundation for Basic Research. \u2021Research supported in part by Award RB17164 of the Research Board of the University of Illinois at Urbana-Champaign.",
year = "2021",
doi = "10.4310/JOC.2021.v12.n2.a4",
language = "English (US)",
volume = "12",
pages = "247--268",
journal = "Journal of Combinatorics",
issn = "2156-3527",
publisher = "International Press, Inc.",
number = "2",
}