You can edit almost every page by Creating an account. Otherwise, see the FAQ.

Reinhard Diestel

From EverybodyWiki Bios & Wiki

Script error: No such module "AfC submission catcheck".

Reinhard Diestel (2007)

Reinhard Diestel (born 1959) is a German mathematician who studies graph theory.

Diestel held a scholarship from 1983 to 1986 and was a Knights Prize winner at Trinity College of Cambridge University, where he received his doctorate in 1986 under Béla Bollobás (Simplicial Decompositions and Universal Graphs). Diestel was then a fellow at St John's College of Cambridge until 1990. In 1987 he completed his habilitation at the University of Hamburg. He then carried out research in USA and at Bielefeld University and received a Heisenberg scholarship from University of Oxford in 1993/94.

From 1994 to 1996 he was a professor at the Chemnitz University of Technology. He has since been a professor at the University of Hamburg.

Diestel is known as the author of a standard work on graph theory.


  • Diestel, Reinhard (2017). Graph Theory (5 ed.). Springer. ISBN 978-3-662-53621-6. Search this book on
  • Diestel, Reinhard (1990). Graph Decompositions: a study in infinite graph theory. Oxford University Press. ISBN 0-19-853210-5. Search this book on

External links[edit]

This article "Reinhard Diestel" is from Wikipedia. The list of its authors can be seen in its historical and/or the page Edithistory:Reinhard Diestel. Articles copied from Draft Namespace on Wikipedia could be seen on the Draft Namespace of Wikipedia and not main one.