معرفی
Prof. Johannes Carmesin is a Professor at the Faculty for Mathematics and Computer Science, Technische Universität Bergakademie Freiberg. His research focuses on advanced topics in Graph Theory, Combinatorics, and Topology, with notable contributions to 3-dimensional Kuratowski-type theorems and the extension of Structural Graph Theory to simplicial complexes. He leads the Discrete Structures group, which explores areas including Graph Minors, Matroid Theory, and Infinite Graphs.
Education and Career: He holds a PhD (2015) and Habilitation (2018) in Mathematics, with earlier work on harmonic functions in networks (Master's 2012). His academic journey includes research on infinite matroids and tree-decompositions.
Research Interests: Carmesin’s work bridges discrete mathematics and topology, emphasizing structural properties of graphs and their embeddings. Key areas include 3D graph embeddings, connectivity in infinite graphs, and matroid characterizations. He has pioneered methods for analyzing 2-dimensional simplicial complexes and their topological representations.
Recent Trends in Publications: His recent work extends Graph Minor Theory to temporal networks and 3D spaces, with a focus on canonical decompositions, tangle theory, and applications in large-scale network analysis. His 2023 European Prize in Combinatorics recognizes breakthroughs in 3D Kuratowski analogues.
- Awards: European Prize in Combinatorics (2023)
Advising and Team: Supervised PhD students Emily Nevinson and Tsvetomir Mihaylov, and mentored master’s students like Will J. Turner. His research team includes Dr. Jan Kurkofka and Dr. Matthew Kroeker. Notable collaborations address infinite graph connectivity and Stallings-type theorems for finite groups.
Labs/Groups: Directs the Discrete Structures research group, which hosts regular seminars and collaborates internationally. Past members include Georgios Kontogeorgiou and Lyuben Lichev as interns.
