A note on maximum size of Berge-$C_4$-free hypergraphs
Combinatorics
2020-05-05 v2
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.
Cite
@article{arxiv.2001.01184,
title = {A note on maximum size of Berge-$C_4$-free hypergraphs},
author = {Beka Ergemlidze},
journal= {arXiv preprint arXiv:2001.01184},
year = {2020}
}