Combinatorial theorems relative to a random set

David Conlon
University of Cambridge

We develop a new technique that allows us to show, in a unified way, that many well-known combinatorial theorems, including Turan's theorem, Szemeredi's theorem and Ramsey's theorem, hold almost surely inside sparse random sets. Joint work with W.T. Gowers.

Back to Workshop III: Topics in Graphs and Hypergraphs