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
Publication date: 5 December 2019
Published in: Mathematische Nachrichten (Search for Journal in Brave)
Abstract: We show that an arbitrary infinite graph can be compactified by its ends plus its critical vertex sets, where a finite set of vertices of an infinite graph is critical if its deletion leaves some infinitely many components each with neighbourhood precisely equal to . We further provide a concrete separation system whose -tangles are precisely the ends plus critical vertex sets. Our tangle compactification is a quotient of Diestel's (denoted by ), 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 and our construction of , we show that can be compactified by every inverse limit of compactifications of the sets of components obtained by deleting a finite set of vertices. Diestel's is the finest such compactification, and our 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
- scientific article; zbMATH DE number 2219615
- Tangles and connectivity in graphs
- The end structure of a graph: Recent results and open problems
- ON TANGLES AND MATROIDS
- On endo-homology of complexes of graphs
- scientific article; zbMATH DE number 1159860
- Metric ends, fibers and automorphisms of graphs
- scientific article; zbMATH DE number 4210218
- End simplicial vertices in path graphs
- On End-regular graphs
Infinite graphs (05C63) Extensions of spaces (compactifications, supercompactifications, completions, etc.) (54D35)
Cited In (10)
- A tree-of-tangles theorem for infinite tangles
- End compactifications in non-locally-finite graphs
- End simplicial vertices in path graphs
- Countably determined ends and graphs
- Universal end-compactifications of locally finite graphs
- Tangles are Decided by Weighted Vertex Sets
- Ends and tangles
- Duality theorems for stars and combs IV: Undominating stars
- Duality theorems for stars and combs I: Arbitrary stars and combs
- Tangles and the Stone-Čech compactification of infinite graphs
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)