BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:The Chromatic Number of Dense Random Graphs - Annika Heckel (Unive
 rsity of Oxford)
DTSTART:20160428T133000Z
DTEND:20160428T143000Z
UID:TALK65434@talks.cam.ac.uk
CONTACT:Andrew Thomason
DESCRIPTION:We consider the chromatic number of the dense random graph G(n
 \,p) where p is constant. I will present new upper and lower bounds which 
 are the first ones that match each other up to a term of size o(1) in the 
 denominator. Somewhat surprisingly\, the behaviour of the chromatic number
  changes around p=1-1/e<sup>2</sup>\, with a different limiting effect bei
 ng dominant below and above\nthis value. In contrast to earlier results in
  this range\, the upper bound is obtained through the second moment method
 \, and I will give details on some aspects of the proof.\n
LOCATION:MR12
END:VEVENT
END:VCALENDAR