معرفی
Paul Knappe is a researcher at the University of Hamburg within the Faculty of Mathematics, Computer Science and Natural Sciences, specifically the Department of Mathematics. His work centers on structural graph theory, infinite graphs, and discrete mathematics.
- Supervised by Reinhard Diestel
- Recipient of a doctoral scholarship from the Studienstiftung des Deutschen Volkes
- Focus areas: tree-decompositions, edge-connectivity, tangle-tree duality, and local-global aspects in graphs
His research includes groundbreaking contributions to the classification of typical infinitely edge-connected graphs via strong immersion, the extension of tangle-tree duality to infinite graphs, and new insights into cyclic structures in edge-connected graphs. He has published in journals like the Journal of Graph Theory and Journal of Combinatorial Theory, Series B, with recent work on Farey graphs and Cantor-Bernstein theorems in infinite graph settings.
Paul actively disseminates his findings through open-access summaries and preprints, collaborating with scholars such as Max Pitz, Jan Kurkofka, and Raphael W. Jacobs. He maintains a personal website for project updates and correspondence.
