![[Search]](/static/images/search.gif){kind=small}
![[A-Z Index]](/static/images/az.gif){kind=small}
![[Contact]](/static/images/contact.gif){kind=small}
![[University of Cambridge]](/static/images/identifier2.gif){kind=small}
![[Talks.cam]](/static/images/talkslogosmall.gif)
Wednesday 20 February 2008, 15:00-16:00
The Hajnal-Szemeredi Theorem and sporting events
- đ¤ Speaker: Anton Evseev
- đ Date & Time: Wednesday 20 February 2008, 15:00 - 16:00
- đ Venue: MR4, CMS, Wilberforce Road, Cambridge, CB3 0WB
Questions? Contact
Anton Evseev
Abstract
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.
Series This talk is part of the Junior Algebra and Number Theory seminar series.
Included in Lists
- All CMS events
- All Talks (aka the CURE list)
- bld31
- CMS Events
- DPMMS info aggregator
- DPMMS lists
- DPMMS Lists
- DPMMS Pure Maths Seminar
- Hanchen DaDaDash
- Interested Talks
- Junior Algebra and Number Theory seminar
- MR4, CMS, Wilberforce Road, Cambridge, CB3 0WB
- ndb35's list
- School of Physical Sciences
Note: Ex-directory lists are not shown.