Article contents
Avoiding long Berge cycles: the missing cases k = r + 1 and k = r + 2
Published online by Cambridge University Press: 27 November 2019
Abstract
The maximum size of an r-uniform hypergraph without a Berge cycle of length at least k has been determined for all k ≥ r + 3 by Füredi, 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üredi, Kostochka and Luo.
MSC classification
- Type
- Paper
- Information
- Copyright
- © Cambridge University Press 2019
References
- 3
- Cited by