University of Cambridge > Talks.cam > Combinatorics Seminar > The Multicolour Size Ramsey Number of a Path

  Browse A-Z

Log in

University Account External (via Google)

🔐 Log In

Information on

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

ℹī¸ Information

The Multicolour Size Ramsey Number of a Path

Download to your calendar using vCal

  • UserCsongor Beke (Cambridge)
  • ClockThursday 27 November 2025, 14:30-15:30
  • HouseMR12.

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

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:

Note that ex-directory lists are not shown.

Other lists

English Faculty Lecture Room GR-06/07, 9 West Road, Sidgwick Site. Average on weekdays: 9024.61732852 kWh Homerton College, Hills Road, Cambridge CB2 8PQ

Other talks

Clonal haematopoiesis, early detection and pre-leukemia to leukemia development Geometry and Generalization: The case of Grokking EVERSE Research Software Quality Kit Group Work Argentina 2005 Cooperation for Nature
 

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