Recent papers of our group
Preprints
 Towards a Stallingstype theorem for finite groups (J. Carmesin, G. Kontogeorgiou, J. Kurkofka, W. Turner), Preprint; pdf
 How to apply tree decomposition ideas in large networks? (J. Carmesin, S. Frenkel), Preprint; pdf
 Embedding simply connected 2complexes in 3space (J. Carmesin), Preprint; pdf
 Canonical graph decompositions via coverings (R. Diestel, R.W. Jacobs, P. Knappe and J. Kurkofka), Preprint; pdf
 Polychromatic Colorings of Geometric Hypergraphs via Shallow Hitting Sets (T. Planken, T. Ueckerdt), Preprint; pdf
 Shallow Hitting Edge Sets in Uniform Hypergraphs (T. Planken, T. Ueckerdt), Preprint; pdf
 On the edgechromatic number of 2complexes (J. Kurkofka, E. Nevinson), Preprint; pdf
 Characterising 4tangles through a connectivity property (J. Carmesin, J.Kurkofka), Preprint; pdf
 Dual matroids of 2complexes  revisited (J. Carmesin), Preprint; pdf
 Outerspatial 2complexes: Extending the class of outerplanar graphs to three dimensions (J. Carmesin, T. Mihaylov), Preprint; pdf
 A Whitney type theorem for surfaces: characterising graphs with locally planar embeddings (J. Carmesin), Preprint; pdf
 Large highly connected subgraphs in graphs with linear average degree (J. Carmesin), Preprint; pdf
 A representation theorem for end spaces of infinite graphs (J. Kurkofka, M. Pitz), Preprint; pdf
2024
 Entanglements (J. Carmesin, J. Kurkofka), Journal of Combinatorial Theory, Series B 164, pages 1728 (2024); pdf
 The immersionminimal infinitely edgeconnected graph (P. Knappe, J. Kurkofka), Journal of Combinatorial Theory, Series B 164, pages 492516 (2024); pdf
2023
 Canonical decompositions of 3connected graphs (J. Carmesin, J.Kurkofka), FOCS 2023, 50 pages; pdf
 On Andreae's Ubiquity Conjecture (J. Carmesin), Journal of Combinatorial Theory, Series B 162, pages 6870 (2023); pdf
 Characterising graphs with no subdivision of a wheel of bounded diameter (J. Carmesin), Journal of Combinatorial Theory, Series B, Volume 161, Pages 2151 (2023); pdf
2022
 Graph Theory  A Survey on the Occasion of the Abel Prize for László Lovász (J. Carmesin), Jahresbericht der Deutschen MathematikerVereinigung volume 124, pages 83108 (2022); pdf
 Local 2separators (J. Carmesin), Journal of Combinatorial Theory, Series B, Volume 156, 2022, Pages 101144, pdf
 New Constructions related to the Polynomial Sphere Recognition Problem (J. Carmesin, L. Lichev), Discret. Comput. Geom., volume 67, 2022, pages 10971123; pdf
 Canonical trees of treedecompositions (J. Carmesin, M. Hamann, B. Miraftab), Journal of Combinatorial Theory, Series B, Volume 152, 2022, Pages 126; pdf
Editorships
Innovations in Graph TheoryDiscrete Mathematics
Papers
 Towards a Stallingstype theorem for finite groups (with G. Kontogeorgiou, J. Kurkofka, W. Turner), Preprint; pdf
 How to apply tree decomposition ideas in large networks? (with S. Frenkel), Preprint; pdf
 Embedding simply connected 2complexes in 3space, Preprint; pdf
 Canonical decompositions of 3connected graphs (with J.Kurkofka), FOCS 2023, 50 pages; pdf
 Characterising 4tangles through a connectivity property (with J.Kurkofka), Preprint; pdf
 Graph Theory  A Survey on the Occasion of the Abel Prize for László Lovász, Jahresbericht der Deutschen MathematikerVereinigung volume 124, pages 83108 (2022); pdf
 Dual matroids of 2complexes  revisited, Preprint; pdf
 On Andreae's Ubiquity Conjecture, Journal of Combinatorial Theory, Series B 162, pages 6870 (2023); pdf
 Entanglements (with J. Kurkofka), Journal of Combinatorial Theory, Series B 164, pages 1728 (2024); pdf
 A characterisation of 3colourable 3dimensional triangulations (with E. Nevinson and B. Saunders), Preprint; pdf
 Outerspatial 2complexes: Extending the class of outerplanar graphs to three dimensions (with T. Mihaylov), Preprint; pdf
 A Whitney type theorem for surfaces: characterising graphs with locally planar embeddings, Preprint; pdf
 Characterising graphs with no subdivision of a wheel of bounded diameter, Journal of Combinatorial Theory, Series B, Volume 161, Pages 2151 (2023); pdf
 Local 2separators, Journal of Combinatorial Theory, Series B, Volume 156, 2022, Pages 101144, pdf
 Large highly connected subgraphs in graphs with linear average degree, Preprint; pdf
 New Constructions related to the Polynomial Sphere Recognition Problem (with L. Lichev), Discret. Comput. Geom., volume 67, 2022, pages 10971123; pdf
 Canonical trees of treedecompositions (with M. Hamann and B. Miraftab), Journal of Combinatorial Theory, Series B, Volume 152, 2022, Pages 126; pdf
 The Almost Intersection Property for Pairs of Matroids on Common Groundset (with N. Bowler, S. Ghaderi and J. Wojciechowski), The Electronic Journal of Combinatorics, Pages 35 (2020); pdf
 Embedding simply connected 2complexes in 3space I, Preprint; pdf
 Embedding simply connected 2complexes in 3space II, Preprint; pdf
 Embedding simply connected 2complexes in 3space III, Preprint; pdf
 Embedding simply connected 2complexes in 3space IV, Preprint; pdf
 Embedding simply connected 2complexes in 3space V, Preprint; pdf
 On treedecompositions of oneended graphs (with F. Lehner & R. Möller), Math. Nachrichten 292.3: Pages 524539 (2019); pdf
 A Liouville hyperbolic souvlaki (with B. Federici & A. Georgakopoulos), Electron. J. Probab., Volume 22 (2017), paper no. 36, 19 pages; pdf
 The colouring number of infinite graphs (with N. Bowler, P. Komjáth & C. Reiher), Combinatorica, Volume 39, Pages 12251235 (2019); pdf
 A short proof that every finite graph has a treedecomposition displaying its tangles, European J. Combin. 58 (2016), 6165; pdf
 Canonical treedecompositions of a graph that display its kblocks (with Pascal Gollin), J. Combin. Theory Ser. B , Volume 122 (2017), Pages 120; pdf

Reconstruction of infinite matroids from their 3connected minors (with N. Bowler & L. Postle), European J. Combin. (2018), volume 67, pages 126144;
pdf
 Every planar graph with the Liouville property is amenable (with Agelos Georgakopoulos), Random Structures & Algorithms 57.3: Pages 706729 (2020); pdf
 All graphs have treedecompositions displaying their topological ends, Combinatorica, Volume 39 (2019), pages 545596; pdf

Topological cycle matroids of infinite graphs, European J. Combin, Volume 60 (2017), Pages 135150;
pdf
 Infinite trees of matroids (with Nathan Bowler), Preprint; pdf
 On the intersection conjecture for infinite trees of matroids (with Nathan Bowler), Preprint; pdf
 Even an infinite bureaucracy eventually makes a decision, Preprint; pdf
 Topological infinite gammoids, and a new Mengertype theorem for infinite graphs, Electron. J. Combin. 25(2018), no. 3, paper 3.38, 22pp; pdf
 Infinite graphic matroids Part I (with Nathan Bowler & Robin Christian), Combinatorica (2018), volume 38, issue 2, pages 305339; pdf
 Edgedisjoint double rays in infinite graphs: a Halin type result (with Nathan Bowler & Julian Pott), J. Combin. Theory Ser. B 111 (2015), 116; pdf
 The ubiquity of Psimatroids (with Nathan Bowler), Preprint; pdf
 Infinite Matroids and Determinacy of Games (with Nathan Bowler), Preprint; pdf
 Canonical treedecompositions of finite graphs II. Essential parts (with R. Diestel, M. Hamann & F. Hundertmark), J. Combin. Theory Ser. B 118 (2016), 268283; pdf
 Canonical treedecompositions of finite graphs I. Existence and algorithms (with R. Diestel, M. Hamann & F. Hundertmark), J. Combin. Theory Ser. B 116 (2016), 124; pdf
 kBlocks: a connectivity invariant for graphs (with R. Diestel, M. Hamann & F. Hundertmark), SIAM J. Discrete Math. , 284 (2014), pp. 18761891; pdf
 An excluded minors method for infinite matroids (with Nathan Bowler), J. Combin. Theory Ser. B (2018), volume 128, pp. 104113; pdf
 Matroid intersection, base packing and base covering for infinite matroids (with Nathan Bowler), Combinatorica 35 (2015), no. 2, 153180; pdf
 Matroids with an infinite circuitcocircuit intersection (with Nathan Bowler), J. Combin. Theory Ser. B (2014), volume 107, 7891; pdf
 On the intersection of infinite matroids (with Elad AignerHorev & JanOliver Fröhlich), Discrete Mathematics (2018), volume 341, issue 6, pages 15821596; pdf
 Connectivity and treestructure in finite graphs (with Reinhard Diestel, Fabian Hundertmark & Maya Stein), Combinatorica 34 (2014) , 1146; pdf
 A characterization of the locally finite networks admitting nonconstant harmonic functions of finite energy, Potential Analysis 37 (2012), 229245; pdf
Habilitation (2018)
 Embedding simply connected 2complexes in 3space, and further results on infinite graphs and matroids; pdf
Dissertation (2015)
 Treedecompositions in finite and infinite graphs; pdf
Master thesis (2012)
 A characterization of the locally finite networks admitting nonconstant harmonic functions of finite energy; pdf