Trees of tangles in infinite separation systems

DOI10.1017/S0305004121000530zbMath1495.05196arXiv2005.12122OpenAlexW3185360063MaRDI QIDQ5097473

Jakob Kneip, Maximilian Teegen, Christian Elbracht

Publication date: 24 August 2022

Published in: Mathematical Proceedings of the Cambridge Philosophical Society (Search for Journal in Brave)

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

zbMATH Keywords

nested sets of separationstree-of-tangles-type theorem

Mathematics Subject Classification ID

Trees (05C05) Combinatorics of partially ordered sets (06A07) Graph minors (05C83) Infinite graphs (05C63)

Cites Work

• Connectivity and tree structure in finite graphs
• Graph minors. X: Obstructions to tree-decomposition
• Lattices of cuts in graphs
• Ends and tangles
• Profinite separation systems
• Tangle-tree duality in abstract separation systems
• Trees of tangles in abstract separation systems
• Structural submodularity and tangles in abstract separation systems
• All graphs have tree-decompositions displaying their topological ends
• Tangle-tree duality: in graphs, matroids and beyond
• Abstract separation systems
• Profiles of separations: in graphs, matroids, and beyond
• Representations of infinite tree sets
• Canonical trees of tree-decompositions
• Graph Theory
• Vertex Cuts
• Tangles are Decided by Weighted Vertex Sets
• Duality Theorems for Blocks and Tangles in Graphs

This page was built for publication: Trees of tangles in infinite separation systems