Reinhard Diestel (born 1959)[1] is a German mathematician specializing in graph theory, including the interplay among graph minors, matroid theory, tree decomposition, and infinite graphs.
He holds the chair of discrete mathematics at the University of Hamburg.
[2] Diestel has a Ph.D. from the University of Cambridge in England, completed in 1986.
[3] His dissertation, Simplicial Decompositions and Universal Graphs, was supervised by Béla Bollobás.
[3] At Hamburg, his doctoral students have included Daniela Kühn and Maya Stein.