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

  Browse A-Z

Log in

Googledetails Microsoftdetails

🔐 Log In

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

ℹī¸ Information

A generalization of the off-diagonal Ramsey numbers

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.

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

Webinar & LT1, Computer Laboratory, William Gates Building. Trinity Hall, Leslie Stephen Room Oatley 1 Seminar Room, Dept. of Engineering (Trumpington St)

Other talks

Online Causal Inference Seminar Together Now: Cooperation and Collaboration in Social Art Practice Scattering Plenty: the people who made the modern countryside Title to be confirmed TBC Online Causal Inference Semina
 

Š 2006-2025 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity