Jump to content

Reinhard Diestel

From Wikipedia, the free encyclopedia

Diestel in 2007

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]

Education and career

[edit]

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.[4]

He continued at Cambridge as a fellow of St. John's College, Cambridge until 1990. In 1994, he took a professorship at the Chemnitz University of Technology, and in 1999 he was given his current chair at the University of Hamburg.[3]

At Hamburg, his doctoral students have included Daniela Kühn and Maya Stein.[4]

Books

[edit]

Diestel's books include:

  • Graph Decompositions: A Study in Infinite Graph Theory (Oxford University Press, 1990)[5]
  • Graph Theory (Graduate Texts in Mathematics 173, Springer, 1997; 6th ed., 2024). Originally published in German as Graphentheorie (1996), and translated into Chinese, Japanese, and Russian.[6]
  • Tangles: A Structural Approach to Artificial Intelligence in the Empirical Sciences (Cambridge University Press, 2024; arXiv:2006.01830)

References

[edit]
  1. ^ Reinhard Diestel, German National Library, retrieved 2024-10-07
  2. ^ "Dauerhafte Mitglieder – Long-term members", Forschungsschwerpunkt Diskrete Mathematik (in German), University of Hamburg, retrieved 2024-10-07
  3. ^ a b Summary of CV, from online edition of Graph Theory (3rd ed.), retrieved 2024-10-07.
  4. ^ a b Reinhard Diestel at the Mathematics Genealogy Project
  5. ^ Reviews of Graph Decompositions:
  6. ^ Reviews of Graph Theory:
[edit]