Random multilinear maps and the Erd\H{o}s box problem
Combinatorics
2021-09-28 v2
Abstract
By using random multilinear maps, we provide new lower bounds for the Erd\H{o}s box problem, the problem of estimating the extremal number of the complete -partite -uniform hypergraph with two vertices in each part, thereby improving on work of Gunderson, R\"{o}dl and Sidorenko.
Cite
@article{arxiv.2011.09024,
title = {Random multilinear maps and the Erd\H{o}s box problem},
author = {David Conlon and Cosmin Pohoata and Dmitriy Zakharov},
journal= {arXiv preprint arXiv:2011.09024},
year = {2021}
}
Comments
Reformatted for Discrete Analysis