University of Cambridge > Talks.cam > Combinatorics Seminar > A geometric approach to Ramsey numbers

  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

A geometric approach to Ramsey numbers

Download to your calendar using vCal

  • UserMarcelo Campos (Cambridge)
  • ClockThursday 17 October 2024, 14:30-15:30
  • HouseMR12.

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

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:

Note that ex-directory lists are not shown.

Other lists

T001 [Tower Seminar Room], Materials Science and Metallurgy, Department of Department of Plant Sciences, Downing Site Marine/Wolfson Building lecture hall.

Other talks

Title to be confirmed Fun experiments you can only do with frogs From lab to clinic: an introduction to translational research Title to be confirmed Overview of treatment for non-small cell lung cancer Title TBC
 

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