BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:The largest K_s-free induced subgraph in a K_t-free graph - Oliver
  Janzer (University of Cambridge)
DTSTART:20181101T143000Z
DTEND:20181101T153000Z
UID:TALK109876@talks.cam.ac.uk
CONTACT:Andrew Thomason
DESCRIPTION:The Erdős-Rogers function measures how large a K_s-free induc
 ed subgraph there must be in a K_t-free graph on n vertices. Good estimate
 s are known when t=s+1\, but in general there are significant gaps between
  the best known lower and upper bounds. We have improved the best known up
 per bound for s+2<=t<=2s-1. In this talk\, I shall describe the constructi
 on\, and sketch the proof that it has the required properties. This is joi
 nt work with Tim Gowers
LOCATION:MR12
END:VEVENT
END:VCALENDAR