papers
Publications (17)
math.CO2009
On the homology of locally finite graphs
Reinhard Diestel, Philipp Sprüssel
math.AT2011
On the homology of locally compact spaces with ends
Reinhard Diestel, Philipp Sprüssel
math.AT2010
Locally finite graphs with ends: a topological approach. III. Fundamental group and homology
Reinhard Diestel, Philipp Sprüssel
math.CO2009
The fundamental group of a locally finite graph with ends
Reinhard Diestel, Philipp Sprüssel
math.CO2014
Canonical tree-decompositions of finite graphs II. Essential parts
Johannes Carmesin, Reinhard Diestel, Matthias Hamann +1
math.CO2010
The Erdös-Pósa property for clique minors in highly connected graphs
Reinhard Diestel, Ken-ichi Kawarabayashi, Paul Wollan
math.CO2014
Canonical tree-decompositions of finite graphs I. Existence and algorithms
Johannes Carmesin, Reinhard Diestel, Matthias Hamann +1
math.CO2013
Axioms for infinite matroids
Henning Bruhn, Reinhard Diestel, Matthias Kriesell +2
math.CO2014
Connectivity and tree structure in finite graphs
Johannes Carmesin, Reinhard Diestel, Fabian Hundertmark +1
math.CO2012
Forcing finite minors in sparse infinite graphs by large-degree assumptions
Reinhard Diestel
math.CO2015
The structure of 2-separations of infinite matroids
Elad Aigner-Horev, Reinhard Diestel, Luke Postle
math.CO2012
Infinite matroids in graphs
Henning Bruhn, Reinhard Diestel
math.CO2014
Unifying duality theorems for width parameters in graphs and matroids. II. General duality
Reinhard Diestel, Sang-il Oum
math.CO2013
Orthogonality and minimality in the homology of locally finite graphs
Reinhard Diestel, Julian Pott
math.CO2012
Locally finite graphs with ends: a topological approach
Reinhard Diestel
math.CO2011
Dual trees must share their ends
Reinhard Diestel, Julian Pott
math.CO2009
Every rayless graph has an unfriendly partition
Henning Bruhn, Reinhard Diestel, Agelos Georgakopoulos +1