Publications (25)
Topological cycle matroids of infinite graphs
Johannes Carmesin
A characterization of the locally finite networks admitting non-constant harmonic functions of finite energy
Johannes Carmesin
Edge-disjoint double rays in infinite graphs: a Halin type result
Nathan Bowler, Johannes Carmesin, Julian Pott
$k$-Blocks: a connectivity invariant for graphs
Johannes Carmesin, Reinhard Diestel, Matthias Hamann +1
The ubiquity of Psi-matroids
Nathan Bowler, Johannes Carmesin
Embedding simply connected 2-complexes in 3-space -- IV. Dual matroids
Johannes Carmesin
A Liouville hyperbolic souvlaki
Johannes Carmesin, Bruno Federici, Agelos Georgakopoulos
Infinite matroid union
Elad Aigner-Horev, Johannes Carmesin, Jan-Oliver Fröhlich
Canonical tree-decompositions of finite graphs II. Essential parts
Johannes Carmesin, Reinhard Diestel, Matthias Hamann +1
A short proof that every finite graph has a tree-decomposition displaying its tangles
Johannes Carmesin
On the intersection conjecture for infinite trees of matroids
Nathan Bowler, Johannes Carmesin
Canonical tree-decompositions of finite graphs I. Existence and algorithms
Johannes Carmesin, Reinhard Diestel, Matthias Hamann +1
Infinite graphic matroids Part I
Nathan Bowler, Johannes Carmesin, Robin Christian
Connectivity and tree structure in finite graphs
Johannes Carmesin, Reinhard Diestel, Fabian Hundertmark +1
Embedding simply connected 2-complexes in 3-space -- III. Constraint minors
Johannes Carmesin
Reconstruction of infinite matroids from their 3-connected minors
Nathan Bowler, Johannes Carmesin, Luke Postle
Topological infinite gammoids, and a new Menger-type theorem for infinite graphs
Johannes Carmesin
On the intersection of infinite matroids
Elad Aigner-Horev, Johannes Carmesin, Jan-Oliver Fröhlich
Infinite Matroids and Determinacy of Games
Nathan Bowler, Johannes Carmesin
Canonical tree-decompositions of a graph that display its $k$-blocks
Johannes Carmesin, Pascal Gollin
Even an infinite bureaucracy eventually makes a decision
Johannes Carmesin
An excluded minors method for infinite matroids
Nathan Bowler, Johannes Carmesin
Infinite trees of matroids
Nathan Bowler, Johannes Carmesin
Matroid intersection, base packing and base covering for infinite matroids
Nathan Bowler, Johannes Carmesin
Matroids with an infinite circuit-cocircuit intersection
Johannes Carmesin, Nathan Bowler