BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//talks.bham.ac.uk//v3//EN
BEGIN:VEVENT
CATEGORIES:Combinatorics and Probability Seminar
SUMMARY:On the density of critical graphs without large cl
iques - Tom Kelly (University of Birmingham)
DTSTART:20191031T140000Z
DTEND:20191031T150000Z
UID:TALK3942AT
URL:/talk/index/3942
DESCRIPTION:A graph is k-critical if it has chromatic number k
and every proper subgraph is (k-1)-colorable. The
density of critical graphs has been extensively s
tudied. We present an improvement on the best know
n lower bound for the density of critical graphs w
ithout large cliques. We also discuss a connection
to a possible generalization of Reed's Conjecture
.\n\nJoint work with Luke Postle.
LOCATION:Watson LTB
CONTACT:Eoin Long
END:VEVENT
END:VCALENDAR