Duality in Infinite Graphs

DOI10.1017/S0963548305007261zbMath1082.05028OpenAlexW2146437659MaRDI QIDQ3373658

Henning Bruhn, Reinhard Diestel

Publication date: 13 March 2006

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0963548305007261

zbMATH Keywords

graph homologyWhitney's theorem

Mathematics Subject Classification ID

Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10)

Related Items

Every infinitely edge-connected graph contains the Farey graph or \({T_{\aleph_0}\ast t}\) as a minor ⋮ Topological cycle matroids of infinite graphs ⋮ End spaces and spanning trees ⋮ Axioms for infinite matroids ⋮ Labeled trees generating complete, compact, and discrete ultrametric spaces ⋮ Matroid and Tutte-connectivity in infinite graphs ⋮ The fundamental group of a locally finite graph with ends ⋮ The homology of a locally finite graph with ends ⋮ End spaces of graphs are normal ⋮ Duality of Ends ⋮ Dual trees must share their ends ⋮ Percolation, perimetry, planarity ⋮ Connected but not path-connected subspaces of infinite graphs ⋮ Algebraic flow theory of infinite graphs ⋮ Bases and closures under infinite sums ⋮ MacLane's planarity criterion for locally finite graphs ⋮ On the homology of locally compact spaces with ends ⋮ Locally finite graphs with ends: A topological approach. II: Applications ⋮ Graph-like spaces: an introduction ⋮ Locally finite graphs with ends: A topological approach. I: Basic theory ⋮ Infinite matroids in graphs ⋮ Bicycles and left-right tours in locally finite graphs ⋮ Generating the cycle space of planar graphs