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

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

2011-08-26

arxiv.org/abs/1108.5254v2

Mathematics

Combinatorics

Scientific paper

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$.

Affiliated with

Also associated with

No associations

Rating

Turán numbers for $K_{s,t}$-free graphs: topological obstructions and algebraic constructions does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Turán numbers for $K_{s,t}$-free graphs: topological obstructions and algebraic constructions, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Turán numbers for $K_{s,t}$-free graphs: topological obstructions and algebraic constructions will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-501836