A note on the extremal number of Berge-C4
Abstract
We improve the known upper bound for the extremal number of Berge-C4-free 3-uniform hypergraphs. More precisely, we prove that every n-vertex 3-uniform hypergraph with no Berge cycle of length four has at most \[ n3/22+2+O(n) \] hyperedges. This improves the previous best-known leading constant 1/10 to 1/(2+2).
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.