Loading...
research article
Avoiding long Berge cycles: the missing casesk=r+1 andk=r+2
May 1, 2020
The 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.
Type
research article
Web of Science ID
WOS:000577595100003
Authors
Publication date
2020-05-01
Published in
Volume
29
Issue
3
Start page
423
End page
435
Peer reviewed
REVIEWED
EPFL units
Available on Infoscience
October 29, 2020
Use this identifier to reference this record