17 citations · 19 across the 2 of their papers we have counts for
3 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-…
On the intersection of infinite matroids
Elad Aigner-Horev, Johannes Carmesin, Jan-Oliver Fröhlich
We show that the infinite matroid intersection conjecture of Nash-Williams implies the infinite Menger theorem proved recently by Aharoni and Berger. We prove that this conjecture…
Infinite matroid union
Elad Aigner-Horev, Johannes Carmesin, Jan-Oliver Fröhlich
We consider the problem of determining whether the union of two infinite matroids is a matroid. We introduce a superclass of the finitary matroids, the nearly finitary matroids, an…