Access the full text.
Sign up today, get DeepDyve free for 14 days.
D. Cartwright, P. Soardi, W. Woess (1993)
Martin and end compactifications for non-locally finite graphsTransactions of the American Mathematical Society, 338
R. Halin (1965)
Über die Maximalzahl fremder unendlicher Wege in GraphenMathematische Nachrichten, 30
C. Carathéodory (1913)
Über die Begrenzung einfach zusammenhängender GebieteMathematische Annalen, 73
H. Lenstra
Profinite Groups
N Polat (1990)
Cycles and Rays
R Diestel (2010)
Graph Theory
R. Diestel, D. Kühn (2003)
Graph-theoretical versus topological ends of graphsJ. Comb. Theory, Ser. B, 87
K. Heuer (2015)
Excluding a full grid minorAbhandlungen aus dem Mathematischen Seminar der Universität Hamburg, 87
N. Robertson, P. Seymour, R. Thomas (1995)
Excluding Infinite Clique Minors
C. Thomassen, W. Woess (1993)
Vertex-Transitive Graphs and AccessibilityJ. Comb. Theory, Ser. B, 58
(2010)
Graph Theory, 5th edn
H. Freudenthal (1942)
Neuaufbau Der EndentheorieAnnals of Mathematics, 43
R. Diestel, Philipp Sprüssel (2010)
Locally finite graphs with ends: A topological approach, III. Fundamental group and homologyDiscret. Math., 312
N. Robertson, P. Seymour (1991)
Graph minors. X. Obstructions to tree-decompositionJ. Comb. Theory, Ser. B, 52
N. Robertson, P. Seymour, R. Thomas
Transactions of the American Mathematical Society excluding Subdivisions of Infinite Cliques
N Robertson, PD Seymour, R Thomas (1992)
Excluding subdivisions of infinite cliquesTrans. Am. Math. Soc., 332
R Halin (1965)
Über die Maximalzahl fremder unendlicher WegeMath. Nachr., 30
H. Freudenthal (1931)
Über die Enden topologischer Räume und GruppenMathematische Zeitschrift, 33
R. Halin (1964)
Über unendliche Wege in GraphenMathematische Annalen, 157
N. Polat (1990)
Topological Aspects of Infinite Graphs
We show that an arbitrary infinite graph can be compactified by its $${\aleph _0}$$ ℵ 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 $${\aleph _0}$$ ℵ 0 -tangles. The $${\aleph _0}$$ ℵ 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 $${\aleph _0}$$ ℵ 0 -tangles that are ends are precisely the limits of principal ultrafilters.The $${\aleph _0}$$ ℵ 0 -tangles that correspond to a highly connected part, or $${\aleph _0}$$ ℵ 0 -block, of the graph are shown to be precisely those that are closed in the topological space of its finite-order separations.
Abhandlungen aus dem Mathematischen Seminar der Universität Hamburg – Springer Journals
Published: Jan 18, 2017
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.