activity
20092023
most citedLocally finite graphs with ends: a topological approach

54 citations · 280 across the 32 of their papers we have counts for

collaborators
Showing 2015Show all

2 papers · 1 filter

math.CO2015

Tree sets

Reinhard Diestel

We study an abstract notion of tree structure which lies at the common core of various tree-like discrete structures commonly used in combinatorics: trees in graphs, order trees, n…

math.CO2015★ 14 cited

Ends and Tangles

Reinhard Diestel

We show that an arbitrary infinite graph can be compactified by its -tangles in much the same way as the ends of a locally finite graph compactify it in its Freudenthal…