Talk information

Date: Sunday, June 21, 2026
Time: 10:10–11:00
Place: Schreiber 309
Speaker: Eden Kuperwasser (TAU)
Title: Ramsey properties of random structures

Abstract:

Given a graph $H$ and any integer $r \ge 2$, Ramsey’s theorem states that there is a graph $G$ which is $r$-Ramsey for $H$; i.e., any $r$-colouring of the edges of $G$ yields a monochromatic copy of $H$. The celebrated theorem of Rödl and Ruciński from 1995 determined the threshold for when the binomial random graph $G_{n,p}$ is $r$-Ramsey for any fixed $H$.

Rather than ending the story, this milestone result launched a new wave of research: For which $H$ and $r$ is the Ramsey threshold sharp? What is the threshold for the general asymmetric Ramsey theorem? Can one determine thresholds for Ramsey problems when the number of colours is unbounded? In this talk we will discuss the current state of the art in random Ramsey theory, and present several recent results that resolve or make significant progress on these questions.

The talk is based on joint works with Ehud Friedgut, Patrick Morris, Wojciech Samotij, Mathias Schacht, and Yuval Wigderson.