Turán numbers for $K_{s,t}$-free graphs: topological obstructions and algebraic constructions

Pavle Blagojević, Boris Bukh, Roman Karasev

Published 2011-08-26, updated 2012-06-03Version 3

We show that every hypersurface in $\R^s\times \R^s$ contains a large grid, i.e., the set of the form $S\times T$, with $S,T\subset \R^s$. We use this to deduce that the known constructions of extremal $K_{2,2}$-free and $K_{3,3}$-free graphs cannot be generalized to a similar construction of $K_{s,s}$-free graphs for any $s\geq 4$. We also give new constructions of extremal $K_{s,t}$-free graphs for large $t$.