Deryk Osthus


Accepting PhD Students

PhD projects

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.


Research activity per year

If you made any changes in Pure these will be visible here soon.


Dive into the research topics where Deryk Osthus is active. These topic labels come from the works of this person. Together they form a unique fingerprint.
  • 1 Similar Profiles

Collaborations and top research areas from the last five years

Recent external collaboration on country/territory level. Dive into details by clicking on the dots or