The Turán number of the grid

Abstract

For a positive integer $t$, let $F_t$ denote the graph of the $t\times t$ grid. Motivated by a 50-year-old conjecture of Erdős about Turán numbers of $r$-degenerate graphs, we prove that there exists a constant $C=C(t)$ such that $\mathrm{ex}(n,F_t)\le C{n}^{3/2}$. This bound is tight up to the value of $C$. One of the interesting ingredients of our proof is a novel way of using the tensor power trick.

9 pages