Random Processes and Quasirandomness for Decomposition Problems
A rigorous exploration of the crucial role of random processes and quasirandomness in solving decomposition problems within extremal combinatorics, with applications to graph and hypergraph theory.
Abstract: The use of random processes and of various notions of quasirandomness continue to play a crucial role in extremal combinatorics. In this talk I will illustrate this using the example of graph and hypergraph decomposition problems. I will introduce some important questions that researchers have looked at under this lens, provide background and motivation, and explain how random processes and quasirandomness are used to tackle these problems.
This lecture was part of the LMS Computer Science Colloquium 2025, which took place at De Morgan House, London on Tuesday 9 December 2025 and online via Zoom.
Seminar notes & discussion
No public seminar notes on this lecture yet.