A note on maximum size of Berge--free hypergraphs
arXiv:2001.01184
Abstract
In this paper, we consider maximum possible value for the sum of cardinalities of hyperedges of a hypergraph without a Berge -cycle. We significantly improve the previous upper bound provided by Gerbner and Palmer. Furthermore, we provide a construction that slightly improves the previous lower bound.