The Multicolour Size Ramsey Number of a Path

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

• Csongor Beke (Cambridge)
• Thursday 27 November 2025, 14:30-15:30
• MR12.

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

The r-colour size Ramsey number of the path P_k is the smallest m such that some m-edge graph G has a monochromatic P_k in every r-colouring of its edges. The linearity in k has been established by Beck in 1983, but finding the optimal r-dependence has been open since. The lower bound of cr^2 k by Krivelevich was suggested to be optimal, while the best upper bound of Dudek and Pralat is a factor of log r away. In this talk we introduce a new colouring technique that, somewhat surprisingly, yields a log r improvement in the lower bound, solving the problem up to constants. Joint work with Anqi Li and Julian Sahasrabudhe.

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.