On the $(k+2,k)$-problem of Brown, Erd\H{o}s and S\'{o}s for even integers $k$
Yan Wang, Jiasheng Zeng

TL;DR
This paper determines the exact asymptotic maximum edge density for certain uniform hypergraphs with constraints on the number of vertices spanned by edges, extending previous results to all even integers k and specific uniformities r.
Contribution
It provides the exact limit value of the maximum edge density for even k ≥ 4 and r ≥ 2 + sqrt(3/2 * k - 4), generalizing prior work and confirming a conjectured formula.
Findings
Exact limit value is 1/(r^2 - r) for specified parameters.
Extends previous results to all even k ≥ 4 and certain r.
Confirms the conjectured asymptotic density formula.
Abstract
Let denote the maximum number of edges in an -graph on vertices in which every edges span more than vertices. Brown, Erd\H{o}s and S\'{o}s in 1973 conjectured that for every , the limit exists and verified the conjecture for by showing that . Delcourt and Postle, building on the work of Glock, Joos, Kim, K\"uhn, Lichev and Pikhurko, proved that for every , the limit exists, thereby solving this conjecture. Their approach was later generalised by Shangguan to every uniformity : the limit exists for all and . However, its exact value was not determined. When , the exact values of…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsLimits and Structures in Graph Theory · Advanced Graph Theory Research · Stochastic processes and statistical mechanics
