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 -partite -uniform hypergraph with two vertices in each part, thereby improving on work of Gunderson, R"{o}dl and Sidorenko.
Recommendations
Cites work
- Extremal problems for sets forming Boolean algebras and complete partite hypergraphs
- Graphs with few paths of prescribed length between any two vertices
- Norm-graphs and bipartite Turán numbers
- Norm-graphs: Variations and applications
- On a problem of K. Zarankiewicz
- On extremal problems of graphs and generalized graphs
- On the number of graphs without 4-cycles
- Random algebraic construction of extremal graphs
- Rational exponents in extremal graph theory
- Remarks on the box problem
- Some extremal results on complete degenerate hypergraphs
- Supersaturated sparse graphs and hypergraphs
- The history of degenerate (bipartite) extremal graph problems
Cited in
(5)
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)