Talk information
Date: Sunday, November 1, 2026
Time: 10:10–11:00
Place: Schreiber 309
Speaker: Peleg Michaeli (University of Oxford)
Title: A very robust Ramsey theorem for hypergraph matchings
Abstract:
The Ramsey number for matchings in graphs was determined by Cockayne and Lorimer and later extended to hypergraphs by Alon, Frankl and Lovász. Several robust versions of these theorems are known: defect results show that almost-complete (hyper)graphs have asymptotically the same matching-Ramsey behaviour as their complete counterparts, while transference results show that sparse random (hyper)graphs have this behaviour with high probability.
In this talk I will show that the same conclusion follows from a significantly weaker—and simpler—connectivity assumption on the host. Namely, it is enough to assume that the host $r$-uniform hypergraph has no large balanced $r$-partite hole; equivalently, every $r$ sufficiently large pairwise disjoint vertex sets are met by an edge. If the forbidden hole size is sublinear in the number of vertices, then the hypergraph has asymptotically the same matching-Ramsey behaviour as its complete counterpart. The generality of the condition allows us to apply the result to a wide range of hypergraphs, while its simplicity allows us to do so without invoking the regularity lemma or hypergraph containers.
This is the latest in a line of Ramsey transference results under weak deterministic assumptions, which I will briefly survey.
Based on joint work with Peter Keevash.