加载中…
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 hyperedges. This improves the previous best-known leading constant to .

生成讲解博客的中文版本

生成AI智能校验的中文版本