54 citations · 280 across the 32 of their papers we have counts for
4 papers · 1 filter
Infinite matroids in graphs
Henning Bruhn, Reinhard Diestel
It has recently been shown that infinite matroids can be axiomatized in a way that is very similar to finite matroids and permits duality. This was previously thought impossible, s…
Locally finite graphs with ends: a topological approach. III. Fundamental group and homology
Reinhard Diestel, Philipp Sprüssel
This paper is the last part of a comprehensive survey of a newly emerging field: a topological approach to the study of locally finite graphs that crucially incorporates their ends…
The Erdös-Pósa property for clique minors in highly connected graphs
Reinhard Diestel, Ken-ichi Kawarabayashi, Paul Wollan
We prove the existence of a function f: N^2 -> N such that for all p,k in N every (k(p-3) + 14p+14) - connected graph either has k disjoint K_p minors or contains a set of at most…
Axioms for infinite matroids
Henning Bruhn, Reinhard Diestel, Matthias Kriesell +2
We give axiomatic foundations for non-finitary infinite matroids with duality, in terms of independent sets, bases, circuits, closure and rank. This completes the solution to a pro…