The Three-Dimensional Erd\H{o}s Box Problem Has Exponent $11/4$
The Zarankiewicz problem for $3$-uniform hypergraphs asks for the maximum number $z(n)$ of edges in a tripartite hypergraph with $n$ vertices in each part containing no copy of $K_{2,2,2}^{(3)}$ (a ``box''). Erd\H{o}s (1964) proved $z(n) = O(n^{11/4})$. The best previously known lower bound was $\Omega(n^{8/3})$, due t...