Dr Johannes Carmesin

Department of Pure Mathematics and Mathematical Statistics
University of Cambridge
Wilberforce Road, Cambridge CB3 0WB
Room E0.07
E-Mail: j.carmesin@dpmms.cam.ac.uk
Johannes Carmesin

I am a Junior Research Fellow at Emmanuel College in Cambridge.

Papers

  1. Embedding simply connected 2-complexes in 3-space I, Preprint; pdf
  2. Embedding simply connected 2-complexes in 3-space II, Preprint; pdf
  3. Embedding simply connected 2-complexes in 3-space III, Preprint; pdf
  4. Embedding simply connected 2-complexes in 3-space IV, Preprint; pdf
  5. Embedding simply connected 2-complexes in 3-space V, Preprint; pdf
  6. On tree-decompositions of one-ended graphs (with F. Lehner & R. Möller), Preprint; pdf
  7. A Liouville hyperbolic souvlaki (with B. Federici & A. Georgakopoulos), Electron. J. Probab., Volume 22 (2017), paper no. 36, 19 pages; pdf
  8. The colouring number of infinite graphs (with N. Bowler, P. Komjáth & C. Reiher), Preprint; pdf
  9. A short proof that every finite graph has a tree-decomposition displaying its tangles, European J. Combin. 58 (2016), 61-65; pdf
  10. Canonical tree-decompositions of a graph that display its k-blocks (with Pascal Gollin), J. Combin. Theory Ser. B , Volume 122 (2017), Pages 1-20; pdf
  11. Reconstruction of infinite matroids from their 3-connected minors (with N. Bowler & L. Postle), European J. Combin., to appear; pdf
  12. Every planar graph with the Liouville property is amenable (with Agelos Georgakopoulos), Preprint; pdf
  13. All graphs have tree-decompositions displaying their topological ends, Preprint; pdf
  14. Topological cycle matroids of infinite graphs, European J. Combin, Volume 60 (2017), Pages 135-150; pdf
  15. Infinite trees of matroids (with Nathan Bowler), Preprint; pdf
  16. On the intersection conjecture for infinite trees of matroids (with Nathan Bowler), Preprint; pdf
  17. Even an infinite bureaucracy eventually makes a decision, Preprint; pdf
  18. Topological infinite gammoids, and a new Menger-type theorem for infinite graphs, Preprint; pdf
  19. Infinite graphic matroids Part I (with Nathan Bowler & Robin Christian), Combinatorica, to appear; pdf
  20. Edge-disjoint double rays in infinite graphs: a Halin type result (with Nathan Bowler & Julian Pott), J. Combin. Theory Ser. B 111 (2015), 1-16; pdf
  21. The ubiquity of Psi-matroids (with Nathan Bowler), Preprint; pdf
  22. Infinite Matroids and Determinacy of Games (with Nathan Bowler), Preprint; pdf
  23. Canonical tree-decompositions of finite graphs II. Essential parts (with R. Diestel, M. Hamann & F. Hundertmark), J. Combin. Theory Ser. B 118 (2016), 268-283; pdf
  24. Canonical tree-decompositions of finite graphs I. Existence and algorithms (with R. Diestel, M. Hamann & F. Hundertmark), J. Combin. Theory Ser. B 116 (2016), 1-24; pdf
  25. k-Blocks: a connectivity invariant for graphs (with R. Diestel, M. Hamann & F. Hundertmark), SIAM J. Discrete Math. , 28-4 (2014), pp. 1876-1891; pdf
  26. An excluded minors method for infinite matroids (with Nathan Bowler), J. Combin. Theory Ser. B, to appear; pdf
  27. Matroid intersection, base packing and base covering for infinite matroids (with Nathan Bowler), Combinatorica 35 (2015), no. 2, 153-180; pdf
  28. Matroids with an infinite circuit-cocircuit intersection (with Nathan Bowler), J. Combin. Theory Ser. B 107 (2014), 78-91; pdf
  29. On the intersection of infinite matroids (with Elad Aigner-Horev & Jan-Oliver Fröhlich), Discrete Mathematics, to appear; pdf
  30. Connectivity and tree-structure in finite graphs (with Reinhard Diestel, Fabian Hundertmark & Maya Stein), Combinatorica 34 (2014) , 11-46; pdf
  31. A characterization of the locally finite networks admitting non-constant harmonic functions of finite energy, Potential Analysis 37 (2012), 229-245; pdf

Master thesis (2012)

Dissertation (2015)