Ramsey theory: searching for order in chaos
- đ¤ Speaker: Rob Morris (IMPA Rio)
- đ Date & Time: Thursday 02 May 2024, 16:00 - 17:00
- đ Venue: MR2, CMS
Abstract
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
Series This talk is part of the Mordell Lectures series.
Included in Lists
- All CMS events
- All Talks (aka the CURE list)
- bld31
- Centre for Health Leadership and Enterprise
- Chris Davis' list
- CMS Events
- custom
- DPMMS info aggregator
- DPMMS lists
- DPMMS Lists
- DPMMS Pure Maths Seminar
- Faculty of Mathematics Lectures
- Featured lists
- Featured talks
- Guy Emerson's list
- Hanchen DaDaDash
- Interested Talks
- Major Public Lectures in Cambridge
- Mordell Lectures
- MR2, CMS
- Neurons, Fake News, DNA and your iPhone: The Mathematics of Information
- personal list
- School of Physical Sciences
- Statistical Laboratory info aggregator
Note: Ex-directory lists are not shown.
![[Talks.cam]](/static/images/talkslogosmall.gif)

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