The HajnalSzemeredi Theorem and sporting events
Add to your list(s)
Download to your calendar using vCal
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 $n1$ 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/Logic/Number Theory seminar series.
This talk is included in these lists:
Note that exdirectory lists are not shown.
