Ends and tangles

DOI10.1007/S12188-016-0163-0MaRDI QIDQ1688261zbMATH OpenOpenAlexFDO

Authors Reinhard Diestel

Publication date 5 January 2018

Published in Abhandlungen aus dem Mathematischen Seminar der Universität Hamburg (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1510.04050

zbMATH Keywords

compactificationFreudenthal compactificationtangleultrafilter

Mathematics Subject Classification ID

Infinite graphs (05C63)

Abstract: We show that an arbitrary infinite graph can be compactified by its $alep{h}_0$-tangles in much the same way as the ends of a locally finite graph compactify it in its Freudenthal compactification. In general, the ends then appear as a subset of its $alep{h}_0$-tangles. The $alep{h}_0$-tangles of a graph are shown to form an inverse limit of the ultrafilters on the sets of components obtained by deleting a finite set of vertices. The $alep{h}_0$-tangles that are ends are precisely the limits of principal ultrafilters. The $alep{h}_0$-tangles that correspond to a highly connected part, or $alep{h}_0$-block, of the graph are shown to be precisely those that are closed in the topological space of its finite-order separations.

Recommendations

• Ends, tangles and critical vertex sets
• A tree-of-tangles theorem for infinite tangles
• Ends and multi-endings. I
• The fundamental group of a locally finite graph with ends–-a hyperfinite approach
• End compactifications in non-locally-finite graphs

Cites work

• All graphs have tree-decompositions displaying their topological ends
• Excluding a full grid minor
• Excluding infinite clique minors
• Excluding Subdivisions of Infinite Cliques
• Graph minors. X: Obstructions to tree-decomposition
• Graph theory
• Graph-theoretical versus topological ends of graphs.
• Locally finite graphs with ends: A topological approach. II: Applications
• Martin and End Compactifications for Nonlocally Finite Graphs
• Neuaufbau der Endentheorie
• Profinite groups.
• Unifying duality theorems for width parameters in graphs and matroids (extended abstract)
• Vertex-transitive graphs and accessibility
• Über die Enden topologischer Räume und Gruppen
• Über die Maximalzahl fremder unendlicher Wege in Graphen
• Über unendliche Wege in Graphen

Cited in

(21)

• 2-tangles
• A tree-of-tangles theorem for infinite tangles
• Tangle-tree duality in abstract separation systems
• Tangles and the Stone-Čech compactification of infinite graphs
• Flags and tangles
• The prevalence of persistent tangles
• Tangle and ultrafilter: game theoretical interpretation
• Countably determined ends and graphs
• Labeled trees generating complete, compact, and discrete ultrametric spaces
• Tangle and Maximal Ideal
• Between ends and fibers
• scientific article; zbMATH DE number 6140066 (Why is no real title available?)
• Trees of tangles in infinite separation systems
• Duality theorems for stars and combs IV: Undominating stars
• Duality theorems for stars and combs I: Arbitrary stars and combs
• Universal end-compactifications of locally finite graphs
• Efficiently distinguishing all tangles in locally finite graphs
• Connectoids. I: A universal end space theory
• Characterising 4-tangles through a connectivity property
• Totally bounded ultrametric spaces generated by labeled rays
• Tangles, trees, and flowers

This page was built for publication: Ends and tangles

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1688261)