43 citations · 147 across the 33 of their papers we have counts for
7 papers · 1 filter
Infinite graphic matroids Part I
Nathan Bowler, Johannes Carmesin, Robin Christian
An infinite matroid is graphic if all of its finite minors are graphic and the intersection of any circuit with any cocircuit is finite. We show that a matroid is graphic if and on…
Edge-disjoint double rays in infinite graphs: a Halin type result
Nathan Bowler, Johannes Carmesin, Julian Pott
We show that any graph that contains k edge-disjoint double rays for any k>0 contains also infinitely many edge-disjoint double rays. This was conjectured by Andreae in 1981.
Canonical tree-decompositions of finite graphs II. Essential parts
Johannes Carmesin, Reinhard Diestel, Matthias Hamann +1
In Part I of this series we described three algorithms that construct canonical tree-decompositions of graphs which distinguish all their k-blocks and tangles of order k. We now es…
Canonical tree-decompositions of finite graphs I. Existence and algorithms
Johannes Carmesin, Reinhard Diestel, Matthias Hamann +1
We construct tree-decompositions of graphs that distinguish all their k-blocks and tangles of order k, for any fixed integer k. We describe a family of algorithms to construct such…
-Blocks: a connectivity invariant for graphs
Johannes Carmesin, Reinhard Diestel, Matthias Hamann +1
A -block in a graph is a maximal set of at least vertices no two of which can be separated in by fewer than other vertices. The block number of is the…
The ubiquity of Psi-matroids
Nathan Bowler, Johannes Carmesin
Solving (for tame matroids) a problem of Aigner-Horev, Diestel and Postle, we prove that every tame matroid M can be reconstructed from its canonical tree decomposition into 3-conn…