Designs beyond quasirandomness

Add to your list(s) Download to your calendar using vCal

• Stefan Glock (Birmingham)
• Thursday 02 February 2017, 15:00-16:00
• LTC Watson.

If you have a question about this talk, please contact Dr Andrew Treglown.

In a recent breakthrough, Peter Keevash proved the Existence conjecture for combinatorial designs, which has its roots in the 19th century. In joint work with Daniela Kühn, Allan Lo and Deryk Osthus, we gave a new proof of this result, based on the method of iterative absorption. In fact, `regularity boosting ’ allows us to extend our main decomposition result beyond the quasirandom setting and thus to generalise the results of Keevash. In particular, we obtain a resilience version and a minimum degree version. In this talk, we will present our new results within a brief outline of the history of the Existence conjecture and provide an overview of the proof.

This talk is part of the Combinatorics and Probability Seminar series.

This talk is included in these lists:

• Combinatorics and Probability Seminar
• LTC Watson
• School of Mathematics Events

Note that ex-directory lists are not shown.