Abstract: The notion of spread distributions on copies of a given graph (or family of graphs) has played a crucial role in recent developments in probabilistic combinatorics, particularly in studying thresholds in random graphs.
In this talk, I will show how to construct a spread distribution on perfect matching in regular pairs, which can be used together with the regularity lemma to find well-behaved embeddings of sparse graphs.