Random multilinear maps and the Erdős box problem

Abstract

By using random multilinear maps, we provide new lower bounds for the Erdős box problem, the problem of estimating the extremal number of the complete $d$-partite $d$-uniform hypergraph with two vertices in each part, thereby improving on work of Gunderson, Rödl and Sidorenko.

Reformatted for Discrete Analysis