We discuss some 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.
Joint work with David Conlon and Dmitriy Zakharov.
This video is part of the Webinar in Additive Combinatorics series, and this is their YouTube channel.
