Ends, tangles and critical vertex sets

From MaRDI portal
Publication:5204867

DOI10.1002/MANA.201800174zbMATH Open1428.05223arXiv1804.00588OpenAlexW2964139246WikidataQ127888636 ScholiaQ127888636MaRDI QIDQ5204867FDOQ5204867


Authors: Jan Kurkofka, Max F. Pitz Edit this on Wikidata


Publication date: 5 December 2019

Published in: Mathematische Nachrichten (Search for Journal in Brave)

Abstract: We show that an arbitrary infinite graph G can be compactified by its ends plus its critical vertex sets, where a finite set X of vertices of an infinite graph is critical if its deletion leaves some infinitely many components each with neighbourhood precisely equal to X. We further provide a concrete separation system whose aleph0-tangles are precisely the ends plus critical vertex sets. Our tangle compactification vertGvertGamma is a quotient of Diestel's (denoted by vertGvertTheta), and both use tangles to compactify a graph in much the same way as the ends of a locally finite and connected graph compactify it in its Freudenthal compactification. Finally, generalising both Diestel's construction of vertGvertTheta and our construction of vertGvertGamma, we show that G can be compactified by every inverse limit of compactifications of the sets of components obtained by deleting a finite set of vertices. Diestel's vertGvertTheta is the finest such compactification, and our vertGvertGamma is the coarsest one. Both coincide if and only if all tangles are ends. This answers two questions of Diestel.


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




Recommendations





Cited In (10)





This page was built for publication: Ends, tangles and critical vertex sets

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