Deryk Osthus

Surveys and expository papers

Graph and hypergraph colouring via nibble methods: a survey (with Dong-Yeap Kang, Tom Kelly, Daniela Kühn and Abhishek Methuku Proceedings of the 8th European Congress of Mathematics, to appear)
Extremal aspects of graph and hypergraph decomposition problems (with Stefan Glock and Daniela Kühn, Surveys in Combinatorics, London Mathematical Society Lecture Note Series 470, Cambridge University Press (2021), 235-266)
Minimalist designs (with Ben Barber, Stefan Glock, Daniela Kühn Allan Lo and Richard Montgomery, Random Structures and Algorithms 57 (2020) 47-63)
Hamilton cycles in graphs and hypergraphs: an extremal perspective (with Daniela Kühn, Proceedings of the International Congress of Mathematicians 2014, Seoul, Korea, Vol 4, 381-406).
A slightly expanded version of this survey can be found here. Slides for the talk can be found here.
A survey on Hamilton cycles in directed graphs (with Daniela Kühn, European J. Combinatorics 33 (2012), 750-766)
Embedding large subgraphs into dense graphs (with Daniela Kühn), Surveys in Combinatorics 2009 (editors S. Huczynka, J. Mitchell, C. Roney-Dougal), Cambridge University Press, 2009, 137-167.