Combinatorics Seminar
Jeff Cooper
UIC
Sparse hypergraphs with low independence number
Abstract: Tur\'an showed that every graph $G$ on $n$ vertices with average degree $d$ has independence number at least $n/(d+1)$.
Let $F$ be any fixed graph. Ajtai, Erd\H{o}, Komlos, and Szemer\'edi showed that if $G$ contains no copy of $F$, Tur\'an's bound can be
significantly imiproved. In this talk, we give a construction which shows that this theorem does not generalize to hypergraphs. This is joint work with Dhruv Mubayi.
Wednesday February 12, 2014 at 3:00 PM in SEO 427