BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:A Stability Theorem for Maximal K_{r+1}-free graphs - Richard Snyd
 er (University of Memphis)
DTSTART:20160609T133000Z
DTEND:20160609T143000Z
UID:TALK66482@talks.cam.ac.uk
CONTACT:Andrew Thomason
DESCRIPTION:We prove a stability result for maximal K<sub>r+1</sub>-free g
 raphs. More precisely\,\nlet G be a maximal K<sub>r+1</sub>-free graph who
 se number of edges is at most m away from the maximum possible in any K<su
 b>r+1</sub>-free graph. We determine a function f(n) such that if m=o(f(n)
 )\, then G necessarily contains an induced complete r-partite subgraph whi
 ch nearly spans the entire vertex set. We also provide constructions showi
 ng that this function f is best possible.\nThis work resolves questions of
  Tyomkyn and Uzzell.\n\nJoint with Kamil Popielarz and Julian Sahasrabudhe
 .\n
LOCATION:MR12
END:VEVENT
END:VCALENDAR