Colourful Ramsey Theory

Matt Bowen

12:00, Friday, Oct. 25
BURN 1025



Ramsey's theorem roughly says that any colouring of a complete graph is guaranteed to contain a "large"" monochromatic clique. Can we also guarantee the appearance of any specific colourful graphs? Obviously not: we can just colour the entire graph red. However, if we assume that all the colours used appear in roughly equal proportions, things get a bit more interesting. In this talk, we'll prove Ramsey's theorem and extend it to characterize the types of colourful graphs that appear in any "balanced"" colouring of a complete graph.

All graduate students are invited. As with all talks in the graduate student seminar, this talk will be accessible to all graduate students in math and stats.

This seminar was made possible by funding from the McGill mathematics and statistics department and PGSS.

back