Deryk Osthus
| Deryk Osthus | |
|---|---|
| Fields | Mathematics |
| Institutions | University of Birmingham |
| Alma mater |
University of Cambridge Humboldt University of Berlin |
| Notable awards |
European Prize in Combinatorics (2003) Whitehead Prize (2014) |
Deryk Osthus is the Professor of Graph Theory at the School of Mathematics, University of Birmingham. He is known for his research in combinatorics, predominantly in extremal and probabilistic graph theory.[1]
Career
Osthus earned a B.A. in mathematics from Cambridge University in 1996, followed by the Certificate of Advanced Studies in Mathematics (Part III) from Cambridge in 1997. He earned a PhD in theoretical computer science from Humboldt University of Berlin in 2000. From 2000 until 2004, he was a postdoctoral researcher in Berlin. He joined Birmingham University in 2004 as a lecturer. He was appointed Professor in Graph Theory in 2012.[2]
Awards and honours
Together with Daniela Kühn and Alain Plagne, he was one of the first winners of the European Prize in Combinatorics in 2003.[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. Several of their papers resolve long-standing open problems in the area."[4]
References
- ↑ "Professor Deryk Osthus". Birmingham University. Retrieved 7 August 2014.
- ↑ "Deryk Osthus: Short CV". Birmingham University. Retrieved 9 August 2014.
- ↑ "Awards" (PDF), European Mathematical Society Newsletter, 50: 24, December 2003
- ↑ "LMS Prizes 2014". London Mathematical Society. Retrieved 7 August 2014.