54 citations · 280 across the 32 of their papers we have counts for
4 papers · 1 filter
Connected tree-width
Reinhard Diestel, Malte Müller
The connected tree-width of a graph is the minimum width of a tree-decomposition whose parts induce connected subgraphs. Long cycles are examples of graphs that have small tree-wid…
Forcing finite minors in sparse infinite graphs by large-degree assumptions
Reinhard Diestel
Developing further Stein's recent notion of relative end degrees in infinite graphs, we investigate which degree assumptions can force a locally finite graph to contain a given fin…
A simple existence criterion for normal spanning trees in infinite graphs
Reinhard Diestel
Halin proved in 1978 that there exists a normal spanning tree in every connected graph that satisfies the following two conditions: (i) contains no subdivision of a `fat' $…
The structure of 2-separations of infinite matroids
Elad Aigner-Horev, Reinhard Diestel, Luke Postle
Generalizing a well known theorem for finite matroids, we prove that for every (infinite) connected matroid M there is a unique tree T such that the nodes of T correspond to minors…