9 citations · 10 across the 3 of their papers we have counts for
3 papers
math.CO2012
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…
math.CO2011★ 9 cited
Dual trees must share their ends
Reinhard Diestel, Julian Pott
We extend to infinite graphs the matroidal characterization of finite graph duality, that two graphs are dual iff they have complementary spanning trees in some common edge set. Th…
math.CO2009★ 1 cited
On the homology of locally finite graphs
Reinhard Diestel, Philipp Sprüssel
We show that the topological cycle space of a locally finite graph is a canonical quotient of the first singular homology group of its Freudenthal compactification, and we characte…