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.
此内容由惯性聚合(RSS阅读器)自动聚合整理，仅供阅读参考。 原文来自 — 版权归原作者所有。