Professor Deryk Osthus

School of Mathematics
Professor in Graph Theory

Contact details

School of Mathematics
Watson Building
University of Birmingham
B15 2TT

The main research area of Deryk Osthus is Combinatorics. He currently works on random graphs, randomized algorithms, Ramsey theory and extremal graph theory.

He has obtained several significant grants, including several from the EPSRC. Moreover he held an ERC consolidator grant 'Asymptotic properties of graphs' (2012-2017).

He was awarded the European Prize in Combinatorics in 2003 and the London Mathematical Society Whitehead prize in 2014. Further recognition for his research includes an invited lecture at the International Congress of Mathematicians in Seoul in 2014. In 2021, he was awarded the Fulkerson prize.

Personal webpage.


  • Habilitation in Computer Science,  Humboldt-University Berlin, 2004
  • PhD in Computer Science,  Humboldt-University Berlin, 2000
  • MMath in Mathematics, University of Cambridge, 1997
  • BA in Mathematics, University of Cambridge, 1996


Deryk Osthus obtained a BA in Mathematics from Cambridge in 1996 and was awarded the Certificate of Advanced Studies in Mathematics (Part III) from the University of Cambridge in 1997.

In 2000, he obtained a PhD in Theoretical Computer Science at the Humboldt-University Berlin, where he also obtained his Habilitation in 2004. In 2003, he was awarded the European Prize in Combinatorics (jointly with Daniela Kühn).

In 2004, he moved to Birmingham to take up a position as a lecturer. He was promoted to Senior Lecturer in 2010.

He was promoted to Professor in 2012.

In 2021, he was awarded the Fulkerson prize (jointly with Bela Csaba, Daniela Kühn, Allan Lo and Andrew Treglown).

Postgraduate supervision

Deryk Osthus is happy to supervise PhD students in Combinatorics. If you are interested, please email him.


Research Themes

  • Combinatorics, especially Extremal and Probabilistic Graph Theory

Research Activity

The main research area of Deryk Osthus is combinatorics. He has worked on random graphs, randomized algorithms and extremal graph theory.

More recent results include:

In 2016 (jointly with S. Glock, D. Kühn and A. Lo) he gave a combinatorial proof of the existence of designs and in 2017 the same team extended this to prove the existence of F-designs for arbitrary hypergraphs F. With F. Joos, S. Glock and D. Kühn, he used the latter to prove a conjecture of Chung-Diaconis-Graham on Euler tours in hypergraphs;

In 2018 (jointly with S. Glock, F. Joos, J. Kim, D. Kühn) he resolved the Oberwolfach problem on decomposing complete graphs into cycle factors for all large n;

In 2021 (jointly with D. Kang, T. Kelly, D. Kühn and A. Methuku), he proved the Erdos-Faber-Lovasz conjecture on edge-colouring linear hypergraphs.


A complete list of my preprints and publications is available on Deryk Osthus's personal webpage

View all publications in research portal