Back to Search
Start Over
Avoiding long Berge cycles, the missing cases $k=r+1$ and $k = r+2$
- Publication Year :
- 2018
-
Abstract
- 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.
- Subjects :
- Mathematics - Combinatorics
Subjects
Details
- Database :
- arXiv
- Publication Type :
- Report
- Accession number :
- edsarx.1808.07687
- Document Type :
- Working Paper