BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Hypergraph containers and list colourings - David Saxton (Universi
 ty of Cambridge)
DTSTART:20111020T133000Z
DTEND:20111020T143000Z
UID:TALK33894@talks.cam.ac.uk
CONTACT:Andrew Thomason
DESCRIPTION:A container set for a hypergraph is a collection of subsets of
  the vertex set such that each independent set is a subset of a member of 
 the collection. It is useful to have a small collection of bounded size co
 ntainers\, and we describe ways to acquire one. Lower bounds can thereby b
 e established on the list chromatic number of the hypergraph\, and we ment
 ion further applications.
LOCATION:MR12
END:VEVENT
END:VCALENDAR