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.
Published - 2011.09024.pdf