## FUNDED PROJECTS

Properties of extremal and random hypergraphs (Richard Mycroft, funded by EPSRC, 2018-2020)

Designs, intersections and matchings (Andrey Kupavskii, Advanced Postdoc Mobility of SNSF, 2018-2019)

Dynamic models of random simplicial complexes (Nikolaos Fountoulakis, funded by EPSRC, 2018-2020)

Packing and Covering in Graphs (Felix Joos, DFG Research Fellowship, 2017-2019)

New approaches to Gibbs measures at the interface of probability and computational complexity (Will Perkins, EPSRC first grant, 2016-2018)

A graph theoretical approach for combinatorial designs (Allan Lo, EPSRC first grant, 2016-2018)

Combinatorics, Probability and Algorithms (Daniela Kühn, EPSRC established career fellowship, 2016-2021)

Independence in groups, graphs and the integers (Andrew Treglown, EPSRC fellowship, 2015-2018)

Randomized approaches to combinatorial packing and covering problems (Daniela Kühn, Deryk Osthus, funded by EPSRC, 2015-2018)

Embeddings in hypergraphs (Richard Mycroft, EPSRC first grant, 2015-2017)

Robustness of properties of random and pseudo-random graphs (Dan Hefetz, EPSRC first grant, 2013-2015)

Inhomogeneity and generalised bootstrap percolation in stochastic networks (Nikolaos Fountoulakis, EPSRC first grant, 2013-2015)

Asymptotic properties of graphs (Deryk Osthus, ERC starting grant, 2012-2018)

Edge-colourings and Hamilton decompositions of graphs (Deryk Osthus, Daniela Kühn, funded by EPSRC, 2012-2014)

Hyperbolic random graphs (Nikolaos Fountoulakis, funded by FP7, 2011-2015)

Quasirandomness for graphs and hypergraphs (Daniela Kühn, ERC starting grant, 2010-2015)

Problems in Extremal Graph Theory (Daniela Kühn, Deryk Osthus, Diana Piguet, Marie Curie fellowship, 2010-2014)

The regularity method for directed graphs (Daniela Kühn, Deryk Osthus, funded by EPSRC, 2007-2011)

Graph expansion and applications (Deryk Osthus, EPSRC first grant, 2007-2009)

Probabilistic methods in Graph theory (Daniela Kühn, EPSRC first grant 2006-2008)