On the (k+2,k)-problem of Brown, Erdos and S\'os for even integers k
Abstract
Let f(r)(n;s,k) denote the maximum number of edges in an r-graph on n vertices in which every k edges span more than s vertices. Brown, Erdos and S\'os in 1973 conjectured that for every k≥ 2, the limit n∞ n-2 f(3)(n;k+2,k) exists and verified the conjecture for k=2 by showing that n∞ n-2 f(3)(n;4,2)=16. Delcourt and Postle, building on the work of Glock, Joos, Kim, K\"uhn, Lichev and Pikhurko, proved that for every k≥ 2, the limit n∞ n-2 f(3)(n;k+2,k) exists, thereby solving this conjecture. Their approach was later generalised by Shangguan to every uniformity r≥ 4: the limit n∞ n-2 f(r)(n; rk-2k+2,k) exists for all r≥ 3 and k≥ 2. However, its exact value was not determined. When k∈\2,3,…,7\, the exact values of n∞ n-2 f(r)(n; rk-2k+2,k) were determined by Glock, Joos, Kim, K\"uhn, Lichev, Pikhurko, R\"odl and Sun. Very recently, the limit for k=8 and r≥ 4 was determined by Pikhurko and Sun. For a general even integer k, Letzter and Sgueglia obtained the exact values of n∞ n-2 f(r)(n;rk-2k+2,k) for every even integer k and uniformity r≥ 2+2\,k3/2. In this paper, we determine the exact value of n∞ n-2 f(r)(n;rk-2k+2,k) for every even integer k≥ 4 and r≥ 2+32k-4, and show that it is 1r2-r.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.