A note on the Tur\'an number of a Berge odd cycle
Combinatorics
2021-05-25 v2
Abstract
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 F\"uredi and \"Ozkahya in 2017. The result follows from a more general theorem. We also obtain some new results for Berge cliques.
Cite
@article{arxiv.1903.01002,
title = {A note on the Tur\'an number of a Berge odd cycle},
author = {Dániel Gerbner},
journal= {arXiv preprint arXiv:1903.01002},
year = {2021}
}
Comments
7 pages