Avoiding long Berge cycles: the missing casesk=r+1 andk=r+2
2020
Abstract
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
Details
Title
Avoiding long Berge cycles: the missing casesk=r+1 andk=r+2
Author(s)
Ergemlidze, Beka ; Gyori, Ervin ; Methuku, Abhishek ; Salia, Nika ; Tompkins, Casey ; Zamora, Oscar
Published in
Combinatorics Probability & Computing
Volume
29
Issue
3
Pages
423-435
Date
2020-05-01
ISSN
0963-5483
1469-2163
1469-2163
Other identifier(s)
View record in Web of Science
Laboratories
DCG
Record Appears in
Scientific production and competences > SB - School of Basic Sciences > SB Archives > DCG - Chair of Combinatorial Geometry
Scientific production and competences > SB - School of Basic Sciences > Mathematics
Peer-reviewed publications
Work produced at EPFL
Journal Articles
Published
Scientific production and competences > SB - School of Basic Sciences > Mathematics
Peer-reviewed publications
Work produced at EPFL
Journal Articles
Published
Record creation date
2020-10-29