9 citations · 16 across the 3 of their papers we have counts for
5 papers
Linkages in Large Graphs of Bounded Tree-Width
Jan-Oliver Fröhlich, Ken-ichi Kawarabayashi, Theodor Müller +2
We show that all sufficiently large (2k+3)-connected graphs of bounded tree-width are k-linked. Thomassen has conjectured that all sufficiently large (2k+2)-connected graphs are k-…
Orthogonality and minimality in the homology of locally finite graphs
Reinhard Diestel, Julian Pott
Given a finite set , a subset (viewed as a function $E\to \F_2$) is orthogonal to a given subspace $\FF$ of the $\F_2$-vector space of functions $E\to \F_2$ as soon as…
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.
Dual trees must share their ends
Reinhard Diestel, Julian Pott
We extend to infinite graphs the matroidal characterization of finite graph duality, that two graphs are dual iff they have complementary spanning trees in some common edge set. Th…
Transitivity conditions in infinite graphs
Matthias Hamann, Julian Pott
We study transitivity properties of graphs with more than one end. We completely classify the distance-transitive such graphs and, for all , the -CS-transitive such gr…