On the -problem of Brown, Erdős and Sós for even integers
arXiv:2603.19345
Abstract
Let denote the maximum number of edges in an -graph on vertices in which every edges span more than vertices. Brown, Erdős and Só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ühn, 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 were determined by Glock, Joos, Kim, Kühn, Lichev, Pikhurko, Rödl and Sun. Very recently, the limit for and was determined by Pikhurko and Sun. For a general even integer , Letzter and Sgueglia obtained the exact values of for every even integer and uniformity . In this paper, we determine the exact value of for every even integer and , and show that it is
13 pages, 1 figure