Reinhard Diestel
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]- ^ Reinhard Diestel, German National Library, retrieved 2024-10-07
- ^ "Dauerhafte Mitglieder – Long-term members", Forschungsschwerpunkt Diskrete Mathematik (in German), University of Hamburg, retrieved 2024-10-07
- ^ a b Summary of CV, from online edition of Graph Theory (3rd ed.), retrieved 2024-10-07.
- ^ a b Reinhard Diestel at the Mathematics Genealogy Project
- ^ Reviews of Graph Decompositions:
- Graham Brightwell (1992), Bulletin of the London Mathematical Society, doi:10.1112/blms/24.1.90
- R. C. Entringer, Zbl 0726.05001
- Bojan Mohar, MR1078627
- ^ Reviews of Graph Theory:
- Michael O. Albertson (1999), Bulletin of the American Mathematical Society, doi:10.1090/S0273-0979-99-00781-8
- Robert A. Beezer (1999), SIAM Review, JSTOR 2653081 (1st ed.)
- R. C. Entringer, Zbl 0859.05001 (German ed.), Zbl 0873.05001 (1st ed.), Zbl 0957.05001 (2nd German ed.)
- Ian Anderson (2001), The Mathematical Gazette, doi:10.2307/3620535, JSTOR 3620535 (2nd ed.)
- Jozef Fiamčik, Zbl 0945.05002 (2nd ed.), Zbl 1074.05001 (3rd ed.)
- Persi Diaconis and Ronald Graham (2006), SIAM Review, JSTOR 20453886 (3rd ed.)
- Michael Berg (2006), MAA Reviews (3rd ed.)
- Gabriel Semanišin (2006), MR2159259 (3rd ed.)
- Lutz Volkmann, Zbl 1093.05001 (3rd German ed.)
- Ferdinand Gliviak, Zbl 1204.05001 (4th ed.)
- Florin Nicolae, Zbl 1218.05001 (4th German ed.)
- V. Yegnanarayanan, Zbl 1375.05002 (5th ed.)
External links
[edit]- Home page
- Reinhard Diestel publications indexed by Google Scholar
- Graph Theory home page including free online preview version
