General Events - Department of Mathematics

Abstract: A fundamental result in extremal combinatorics is Turán's theorem: Every K_{r+1}-free graph on n vertices has at most as many edges as the complete balanced n-vertex r-partite graph. In this talk, we discuss several variations of Turán's theorem.