A geometric approach to Ramsey numbers

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

• Marcelo Campos (Cambridge)
• Thursday 17 October 2024, 14:30-15:30
• MR12.

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

Given r and k let R_r(k) be the minimum n such that any r-colouring of K_n contains a monochromatic K_k. In 1935 Erd\H{o}s and Szekeres proved that R_r(k)\leq r^{rk}. In this talk I will discuss a geometric approach to improve this upper bound. Based on joint work with Ballister, Bollobás, Griffiths, Hurley, Morris, Sahasrabudhe and Tiba

This talk is part of the Combinatorics Seminar series.

This talk is included in these lists:

• All CMS events
• All Talks (aka the CURE list)
• CMS Events
• Combinatorics Seminar
• DPMMS Lists
• DPMMS Pure Maths Seminar
• DPMMS info aggregator
• DPMMS lists
• Hanchen DaDaDash
• Interested Talks
• MR12
• School of Physical Sciences
• bld31

Note that ex-directory lists are not shown.