Random multilinear maps and the Erdős box problem

From MaRDI portal



Abstract: By using random multilinear maps, we provide new lower bounds for the ErdH{o}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"{o}dl and Sidorenko.












This page was built for publication: Random multilinear maps and the Erdős box problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5028502)