Erdos-Rademacher problems in extremal set theory

04/09/2013 - 12:15pm
04/09/2013 - 1:10pm
Shagnik Das (UCLA)

The Erdos-Rademacher Theorem is a quantitative strengthening of Mantel's celebrated theorem, answering the following question: how many triangles must a graph with n vertices and n^2 / 4 + t edges have? One can ask similar questions for any extremal problem, namely how many copies of a forbidden configuration must appear once the size of a structure exceeds the extremal threshold? We study this problem for two central results in extremal set theory, Sperner's Theorem and the Erdos-Ko-Rado Theorem, answering questions of Erdos, Katona, Kleitman and West first posed some fifty years ago. This is joint work with Wenying Gan and Benny Sudakov.

Millikan 208 (Pomona College)

Claremont Graduate University | Claremont McKenna | Harvey Mudd | Pitzer | Pomona | Scripps
Proudly Serving Math Community at the Claremont Colleges Since 2007
Copyright © 2018 Claremont Center for the Mathematical Sciences