BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:The Hajnal-Szemeredi Theorem and sporting events - Anton Evseev
DTSTART:20080220T150000Z
DTEND:20080220T160000Z
UID:TALK10832@talks.cam.ac.uk
CONTACT:Anton Evseev
DESCRIPTION:A classical result of Hajnal and Szemeredi states that an orie
 nted graph with $nk$ vertices and maximal degree st most $n-1$ can be prop
 erly coloured so that each colour class contains precisely $n$ vertices. I
  will sketch a recent short proof of this result due to Kierstead and Kost
 ochka and will explain how it could be used to arrange a fair draw in a co
 mpetition. If time allows\, I will also mentioned some problems motivated 
 by this possible application.
LOCATION:MR4\, CMS\, Wilberforce Road\, Cambridge\, CB3 0WB
END:VEVENT
END:VCALENDAR