On the $(k+2,k)$-problem of Brown, Erdős and Sós for $k=5,6,7$

Stefan Glock, Jaehoon Kim, Lyuben Lichev +2

Let $f^{(r)}(n;s,k)$ denote the maximum number of edges in an $n$-vertex $r$-uniform hypergraph containing no subgraph with $k$ edges and at most $s$ vertices. Brown, Erdős and Sós…