On the $(k+2,k)$-problem of Brown, Erdős and Sós for even integers $k$

Fuente: arXiv
Saved in:
Bibliographic Details
Main Authors: Wang, Yan, Zeng, Jiasheng
Format: Preprint
Published: 2026
Subjects:
Online Access:
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866912975114207232
author Wang, Yan
Zeng, Jiasheng
author_facet Wang, Yan
Zeng, Jiasheng
contents 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, Erdős and Sós in 1973 conjectured that for every $k\geq 2$, the limit $\lim_{n\to\infty} n^{-2} f^{(3)}(n;k+2,k)$ exists and verified the conjecture for $k=2$ by showing that $\lim_{n\to\infty} n^{-2} f^{(3)}(n;4,2)=\frac{1}{6}$. Delcourt and Postle, building on the work of Glock, Joos, Kim, Kühn, Lichev and Pikhurko, proved that for every $k\geq 2$, the limit $\lim_{n\to\infty} n^{-2} f^{(3)}(n;k+2,k)$ exists, thereby solving this conjecture. Their approach was later generalised by Shangguan to every uniformity $r\geq 4$: the limit $\lim_{n\to\infty} n^{-2} f^{(r)}(n; rk-2k+2,k)$ exists for all $r\geq 3$ and $k\geq 2$. However, its exact value was not determined. When $k\in\{2,3,\ldots,7\}$, the exact values of $\lim_{n\to\infty} n^{-2} f^{(r)}(n; rk-2k+2,k)$ were determined by Glock, Joos, Kim, Kühn, Lichev, Pikhurko, Rödl and Sun. Very recently, the limit for $k=8$ and $r\geq 4$ was determined by Pikhurko and Sun. For a general even integer $k$, Letzter and Sgueglia obtained the exact values of $\lim_{n\to\infty} n^{-2} f^{(r)}(n;rk-2k+2,k)$ for every even integer $k$ and uniformity $r\geq 2+\sqrt{2}\,k^{3/2}$. In this paper, we determine the exact value of $\lim_{n\to\infty} n^{-2} f^{(r)}(n;rk-2k+2,k)$ for every even integer $k\geq 4$ and $r\geq 2+\sqrt{\frac{3}{2}k-4}$, and show that it is $\frac{1}{r^2-r}.$
format Preprint
id arxiv_https___arxiv_org_abs_2603_19345
institution arXiv
publishDate 2026
record_format arxiv
spellingShingle On the $(k+2,k)$-problem of Brown, Erdős and Sós for even integers $k$
Wang, Yan
Zeng, Jiasheng
Combinatorics
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, Erdős and Sós in 1973 conjectured that for every $k\geq 2$, the limit $\lim_{n\to\infty} n^{-2} f^{(3)}(n;k+2,k)$ exists and verified the conjecture for $k=2$ by showing that $\lim_{n\to\infty} n^{-2} f^{(3)}(n;4,2)=\frac{1}{6}$. Delcourt and Postle, building on the work of Glock, Joos, Kim, Kühn, Lichev and Pikhurko, proved that for every $k\geq 2$, the limit $\lim_{n\to\infty} n^{-2} f^{(3)}(n;k+2,k)$ exists, thereby solving this conjecture. Their approach was later generalised by Shangguan to every uniformity $r\geq 4$: the limit $\lim_{n\to\infty} n^{-2} f^{(r)}(n; rk-2k+2,k)$ exists for all $r\geq 3$ and $k\geq 2$. However, its exact value was not determined. When $k\in\{2,3,\ldots,7\}$, the exact values of $\lim_{n\to\infty} n^{-2} f^{(r)}(n; rk-2k+2,k)$ were determined by Glock, Joos, Kim, Kühn, Lichev, Pikhurko, Rödl and Sun. Very recently, the limit for $k=8$ and $r\geq 4$ was determined by Pikhurko and Sun. For a general even integer $k$, Letzter and Sgueglia obtained the exact values of $\lim_{n\to\infty} n^{-2} f^{(r)}(n;rk-2k+2,k)$ for every even integer $k$ and uniformity $r\geq 2+\sqrt{2}\,k^{3/2}$. In this paper, we determine the exact value of $\lim_{n\to\infty} n^{-2} f^{(r)}(n;rk-2k+2,k)$ for every even integer $k\geq 4$ and $r\geq 2+\sqrt{\frac{3}{2}k-4}$, and show that it is $\frac{1}{r^2-r}.$
title On the $(k+2,k)$-problem of Brown, Erdős and Sós for even integers $k$
topic Combinatorics
url https://arxiv.org/abs/2603.19345