BEGIN:VCALENDAR
VERSION:2.0
PRODID:researchseminars.org
CALSCALE:GREGORIAN
X-WR-CALNAME:researchseminars.org
BEGIN:VEVENT
SUMMARY:Annika Heckel
DTSTART:20200729T070000Z
DTEND:20200729T080000Z
DTSTAMP:20260423T024510Z
UID:CMSAcomb/2
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/CMSAcomb/2/"
 >Non-concentration of the chromatic number</a>\nby Annika Heckel as part o
 f Australasian Combinatorics Seminar\n\n\nAbstract\nThere are many impress
 ive results asserting that the chromatic number of a random graph is sharp
 ly concentrated. In 1987\, Shamir and Spencer showed that for any function
  p=p(n)\, the chromatic number of $G(n\,p)$ takes one of at most about n1/
 2 consecutive values whp. For sparse random graphs\, much sharper concentr
 ation is known to hold: Alon and Krivelevich proved two point concentratio
 n whenever $p< n^{1/2 - \\epsilon}$.\nHowever\, until recently no non-triv
 ial lower bounds for the concentration were known for any $p$\, even thoug
 h the question was raised prominently by Erdős in 1992 and Bollobás in 2
 004.\nIn this talk\, we show that the chromatic number of $G(n\,1/2)$ is n
 ot whp contained in any sequence of intervals of length $n^{1/2-o(1)}$\, a
 lmost matching Shamir and Spencer's upper bound.\nJoint work with Oliver R
 iordan.\n
LOCATION:https://researchseminars.org/talk/CMSAcomb/2/
END:VEVENT
END:VCALENDAR