Welcome to the new version of CaltechAUTHORS. Login is currently restricted to library staff. If you notice any issues, please email coda@library.caltech.edu
Published September 27, 2021 | Published
Journal Article Open

Random Multilinear Maps and the Erdős Box Problem


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 duniform hypergraph with two vertices in each part, thereby improving on work of Gunderson, Rödl and Sidorenko.

Additional Information

© 2021 D. Conlon, C. Pohoata, and D. Zakharov. Licensed under a Creative Commons Attribution License (CC-BY). Research supported by NSF Award DMS-2054452. Research supported by a grant of the Russian Government N 075-15-2019-1926.

Attached Files

Published - 2011.09024.pdf


Files (237.1 kB)
Name Size Download all
237.1 kB Preview Download

Additional details

August 20, 2023
October 23, 2023