Power saving for the Brown-Erdős-Sós problem

Oliver Janzer, Abhishek Methuku, Aleksa Milojević +1

Let $f(n,v,e)$ denote the maximum number of edges in a 3-uniform hypergraph on $n$ vertices which does not contain $v$ vertices spanning at least $e$ edges. A central problem in…