Deryk Osthus

from Wikipedia, the free encyclopedia

Deryk Simeon Osthus (* 1974 ) is a British mathematician . He is particularly concerned with extremal and probabilistic graph theory .

Life

Osthus received his bachelor's degree in 1996 and his Certificate of Advanced Studies in Mathematics (Tripos examinations) in 1997 at the University of Cambridge and received his doctorate in 2000 from the Humboldt University of Berlin under Hans Jürgen Prömel ( On the evolution of random discrete structures ) and stayed there until 2004 as a post-doctoral student (habilitation 2004). In 2004 he became a Lecturer and in 2012 Professor of Graph Theory at the University of Birmingham .

In 2011, together with Daniela Kühn and Richard Mycroft , he proved Sumner's conjecture about tournament graphs (every tournament graph of 2n-2 nodes contains any oriented graph with n nodes).

In 2003 he and Daniela Kühn received the European Prize in Combinatorics for many results in the central area of ​​graph theory, which deals with graph minors and random structures, especially in connection with Hadwinger's conjecture . In 2014 Kühn and Osthus received the Whitehead Prize .

In 2014 he was invited to speak at the International Congress of Mathematicians in Seoul ( Hamilton cycles in graphs and hypergraphs: an extremal perspective , with Daniela Kühn).

Fonts

  • with Daniela Kühn, Richard Mycroft: An approximate version of Sumner's universal tournament conjecture , Journal of Combinatorial Theory, Series B, Volume 101, 2011, pp. 415-447
  • with Daniela Kühn, Richard Mycroft: A proof of Sumner's universal tournament conjecture for large tournaments , Proceedings of the London Mathematical Society, Third Series, Volume 102, 2011, pp. 731-766, Arxiv

Web links

Individual evidence

  1. Deryk Osthus in the Mathematics Genealogy Project (English)Template: MathGenealogyProject / Maintenance / id used
  2. Eurocomb 2003, laudatory speeches for the award