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.
Department of Mathematics
College of Liberal Arts & Sciences
273 Altgeld Hall
1409 W. Green Street (MC-382)
Urbana, IL 61801
Telephone: 217-333-3350
Email: math@illinois.edu