14:00
Tue, 05 May 2026
14:00
14:00
L5
Julian Sahasrabudhe
(University of Cambridge)
In this talk I will discuss some recent progress on a natural relative of the classical Ramsey problem, introduced by Erdős and Rogers. What is the largest K_s-free subset that can be found in every K_{s+1}-free graph on n vertices?
This is based on joint work with Rob Morris and Jacques Verstraete.
A clip from James Maynard's Sophie Germain Oxford Mathematics Public Lecture held at the Royal Institution on 1 April, Sophie's 250th. You can watch all five talks - our own Lukas Brantner, Ana Caraiani, Laura Monk and a Chladni figures demonstration by Dan Plane as well as James- here
You may have noticed we are running a series of short films on the maths behind popular games (card, board, digital, nothing is off limits). So we want contributors for the following games plus any ideas you have of your own.
Poker, Blackjack, Roulette, Chess, Go, Bridge, Monopoly, Tsuro, Carcasonne, Cathedral, Minecraft, Catan, Ticket to Ride, Saboteur, Projective Noughts and Crosses, Projective Set, Splendour, Minesweeper, Backgammon, etc.

TPP is currently looking for bright students to join our close-knit technical team, this diverse role will allow you to kick start your career in the tech industry.
Fridays@2 is back again for Trinity term, and Week 2's session is our highly requested Finals Forum!
Pipp & Co Doughnuts - every Thursday from 30 April, only £3 each: