The Hajnal-Szemeredi Theorem and sporting events

Add to your list(s) Download to your calendar using vCal

• Anton Evseev
• Wednesday 20 February 2008, 15:00-16:00
• MR4, CMS, Wilberforce Road, Cambridge, CB3 0WB.

If you have a question about this talk, please contact Anton Evseev.

A classical result of Hajnal and Szemeredi states that an oriented graph with $nk$ vertices and maximal degree st most $n-1$ can be properly coloured so that each colour class contains precisely $n$ vertices. I will sketch a recent short proof of this result due to Kierstead and Kostochka and will explain how it could be used to arrange a fair draw in a competition. If time allows, I will also mentioned some problems motivated by this possible application.

This talk is part of the Junior Algebra and Number Theory seminar series.

This talk is included in these lists:

• All CMS events
• All Talks (aka the CURE list)
• CMS Events
• DPMMS Lists
• DPMMS Pure Maths Seminar
• DPMMS info aggregator
• DPMMS lists
• Hanchen DaDaDash
• Interested Talks
• Junior Algebra and Number Theory seminar
• MR4, CMS, Wilberforce Road, Cambridge, CB3 0WB
• School of Physical Sciences
• bld31
• ndb35's list

Note that ex-directory lists are not shown.