Colleges, School and Institutes
Willingness to take PhD students
Deryk Osthus’s research interests focus on combinatorics. He has worked on random graphs, randomised algorithms and extremal graph theory. For example, he studied a general version of the perfect matching problem (a perfect matching is a covering of the vertices of a graph by disjoint edges). He is happy to supervise doctoral researchers in the area of combinatorics.