[3] Together with Kühn, he was a recipient of the 2014 Whitehead Prize of the London Mathematical Society for "their many results in extremal graph theory and related areas.
With the variety of intense research that Deryk Osthus was interested in, many grants were needed to conduct, analyze, and publish the research and publications that Deryk Osthus wanted to figure out, and gain more reliable and valid information on graph theories and other detailed areas.
3 years later In March 2015, he received a grant for "Randomized approaches to combinatorial packing and covering problems."
With an education stemming back From the late 90's and early 2000's, Deryk Osthus had many areas of interest in the field of research.
His recent research has included results on Hamilton cycles and more general spanning substructures, as well as decompositions of graphs and hypergraphs.