PhD Defense (Felix Clemen): Variations of Turán's Theorem
- Event Type
- Seminar/Symposium
- Sponsor
- n/a
- Location
- 124 Burrill
- Date
- Feb 17, 2022 11:00 am
- Speaker
- Felix Clemen
- Contact
- Felix Clemen
- fclemen2@illinois.edu
- Views
- 25
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.