Discrete Math Seminar: Extremal graphs without exponentially-small bicliques
Author: Lona | Image: Lona
Speaker: Boris Bukh, Carnegie Mellon University
Abstract: In 1954, Kővári–Sós–Turán gave an upper bound on the number of edges in an nn-vertex Ks,tK_{s,t}-free. We show that the bound is asymptotically tight for t>Cst>C^s, improving on the works of Alon, Kollár, Rónyai, Szabó.