Ramsey theory: searching for order in chaos

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

• Rob Morris (IMPA Rio)
• Thursday 02 May 2024, 16:00-17:00
• MR2, CMS.

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

In many different areas of mathematics (such as number theory, discrete geometry and combinatorics), one is often presented with a large “unstructured” object, and asked to find a smaller “structured” object inside it. One of the earliest and most influential examples of this phenomenon was the theorem of Ramsey, proved in 1930, which states that if n = n(k) is large enough, then in any red-blue colouring of the edges of the complete graph on n vertices, there exists a monochromatic clique on k vertices. In this talk I will discuss some of the questions, ideas, and new techniques that were inspired by this theorem, and mention some recent progress on one of the central problems in the area: bounding the so-called “diagonal” Ramsey numbers.

Based on joint work with Marcelo Campos, Simon Griffiths and Julian Sahasrabudhe.

A wine reception in the Central Core will follow the lecture

This talk is part of the Mordell Lectures series.

This talk is included in these lists:

• All CMS events
• All Talks (aka the CURE list)
• CMS Events
• Centre for Health Leadership and Enterprise
• Chris Davis' list
• DPMMS Lists
• DPMMS Pure Maths Seminar
• DPMMS info aggregator
• DPMMS lists
• Faculty of Mathematics Lectures
• Featured lists
• Featured talks
• Guy Emerson's list
• Hanchen DaDaDash
• Interested Talks
• MR2, CMS
• Major Public Lectures in Cambridge
• Mordell Lectures
• Neurons, Fake News, DNA and your iPhone: The Mathematics of Information
• School of Physical Sciences
• Statistical Laboratory info aggregator
• bld31
• custom
• personal list

Note that ex-directory lists are not shown.