paper

A note on the extremal number of Berge-

arXiv:2606.07126

Abstract

We improve the known upper bound for the extremal number of Berge--free -uniform hypergraphs. More precisely, we prove that every -vertex -uniform hypergraph with no Berge cycle of length four has at most \[ \frac{n^{3/2}}{2+\sqrt2}+O(n) \] hyperedges. This improves the previous best-known leading constant to .