- Combinatorics, especially Extremal and Probabilistic Graph Theory
Her research interests lie in Graph Theory, Probabilistic Methods and Randomized Algorithms.
Her results include the following:
With Csaba, Lo, Osthus and Treglown, she proved the Hamilton decomposition and 1-factorization conjectures (for which they were awarded the Fulkerson prize in 2021);
With Glock, Lo and Osthus, she gave a combinatorial proof of the existence of designs, a problem which goes back to the 19th century (and they also proved the existence of F-designs for arbitrary F);
With Glock, Joos, Kim and Osthus, she resolved the Oberwolfach problem on decomposing complete graphs into cycle factors;
With Kang, Kelly, Methuku and Osthus, she proved the Erdős-Faber-Lovasz conjecture (on colouring linear hypergraphs).