Tutte Colloquium - Richard Lang
Title: Monochromatic cycle partitions
Speaker: | Richard Lang |
Affiliation: | University of Waterloo |
Room: | MC 5501 |
Abstract:
A classic result of Erdős, Gyárfás, and Pyber states that the vertex set of every complete graph, whose edges have been coloured with r colours, can be covered by r2 log r disjoint monochromatic cycles.