$3$-uniform hypergraphs without a cycle of length five
Combinatorics
2019-02-19 v1
Abstract
In this paper we show that the maximum number of hyperedges in a -uniform hypergraph on vertices without a (Berge) cycle of length five is less than , improving an estimate of Bollob\'as and Gy\H{o}ri. We obtain this result by showing that not many -paths can start from certain subgraphs of the shadow.
Keywords
Cite
@article{arxiv.1902.06257,
title = {$3$-uniform hypergraphs without a cycle of length five},
author = {Beka Ergemlidze and Ervin Győri and Abhishek Methuku},
journal= {arXiv preprint arXiv:1902.06257},
year = {2019}
}