机构:
Hungarian Acad Sci, Alfred Renyi Inst Math, POB 127, H-1364 Budapest, HungaryHungarian Acad Sci, Alfred Renyi Inst Math, POB 127, H-1364 Budapest, Hungary
Gerener, Daniel
[1
]
机构:
[1] Hungarian Acad Sci, Alfred Renyi Inst Math, POB 127, H-1364 Budapest, Hungary
In this note we obtain upper bounds on the number of hyperedges in 3-uniform hypergraphs not containing a Berge cycle of given odd length. We improve the bound given by Furedi and Ozkahya in 2017. The result follows from a more general theorem. We also obtain some new results for Berge cliques.