Prof. Emo Welzl and Prof. Bernd Gärtner
|Mittagsseminar Talk Information|
Date and Time: Tuesday, April 07, 2020, 12:15 pm
Duration: 30 minutes
Location: Zoom: conference room
Speaker: Dániel Korándi (University of Oxford)
Turán's theorem says that an extremal Kr+1-free graph is r-partite. The Stability Theorem of Erdős and Simonovits shows that if a Kr+1-free graph with n vertices has close to the maximal tr(n) edges, then it is close to being r-partite. In this talk we determine exactly the Kr+1-free graphs with at least m edges that are farthest from being r-partite, for any m > tr(n) - δn2. This extends work by Erdős, Győri and Simonovits, and proves a conjecture of Balogh, Clemen, Lavrov, Lidický and Pfender. Joint work with Alexander Roberts and Alex Scott.
Automatic MiSe System Software Version 1.4803M | admin login