BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//talks.bham.ac.uk//v3//EN
BEGIN:VEVENT
CATEGORIES:Combinatorics and Probability Seminar
SUMMARY:On the List Coloring Version of Reed's Conjecture
- Michelle Delcourt (University of Birmingham)
DTSTART:20171010T140000Z
DTEND:20171010T150000Z
UID:TALK2826AT
URL:/talk/index/2826
DESCRIPTION:Reed conjectured in 1998 that the chromatic number
of a graph should be at most the average of the c
lique number (a trivial lower bound) and maximum d
egree plus one (a trivial upper bound)\; in suppor
t of this conjecture\, Reed proved that the chroma
tic number is at most some nontrivial convex combi
nation of these two quantities. King and Reed lat
er showed that a fraction of roughly 1/130000 away
from the upper bound holds. Motivated by a paper
by Bruhn and Joos\, last year Bonamy\, Perrett\, a
nd Postle proved for large enough maximum degree\,
a fraction of 1/26 away from the upper bound hold
s\, a signficant step towards the conjectured val
ue of 1/2. Using new techniques\, we show that the
list-coloring version holds\; for large enough ma
ximum degree\, a fraction of 1/13 suffices for lis
t chromatic number. This result implies that 1/13
suffices for ordinary chromatic number as well. Th
is is joint work with Luke Postle.
LOCATION:Watson LTA
CONTACT:Guillem Perarnau
END:VEVENT
END:VCALENDAR