University of Cambridge > > Trinity Mathematical Society > A generalization of the off-diagonal Ramsey numbers

A generalization of the off-diagonal Ramsey numbers

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

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

The Ramsey number R(s,t) stands for the smallest positive integer N such that whenever the edges of the complete graph on N vertices are 2-coloured with red and blue, then there is a red clique on s vertices or a blue clique on t vertices. In this talk, I will review the known results about this function, mentioning some famous open problems. I will also talk about how random graphs can be used to prove lower bounds on R(s,t). Then I will present a generalisation of this function and state a recent result of Gowers and myself, which is based on an unusual random graph construction.`

This talk is part of the Trinity Mathematical Society series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.


© 2006-2024, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity