BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Dense induced bipartite subgraphs in triangle-free graphs - Shoham
  Letzter (University of Cambridge)
DTSTART:20200213T143000Z
DTEND:20200213T153000Z
UID:TALK138478@talks.cam.ac.uk
CONTACT:Andrew Thomason
DESCRIPTION:Erdős\, Faudree\, Pach and Spencer (1988) introduced the prob
 lem of searching for large induced bipartite subgraphs in triangle-free gr
 aphs. We consider a variant of this problem\, where the objective is to fi
 nd induced bipartite subgraphs with large minimum degree. Specifically\, w
 e prove that every triangle-free graph with minimum degree d contains an i
 nduced bipartite\ngraph with minimum degree at least c*log(d)/log(log(d))\
 , thus nearly confirming a conjecture of Esperet\, Kang and Thomassé.\n\n
 This is joint work with Matthew Kwan\, Benny Sudakov and Tuan Tran.\n
LOCATION:MR12
END:VEVENT
END:VCALENDAR