Trees of tangles in infinite separation systems

DOI10.1017/S0305004121000530MaRDI QIDQ5097473zbMATH OpenOpenAlexFDO

Authors Christian Elbracht, Jakob Kneip, Maximilian Teegen

Publication date 24 August 2022

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

Copyright license Creative Commons Attribution 4.0 International

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) Infinite graphs (05C63) Graph minors (05C83) Combinatorics of partially ordered sets (06A07)

Abstract: We present infinite analogues of our splinter lemma from [Trees of tangles in abstract separation systems, arXiv:1909.09030]. From these we derive several tree-of-tangles-type theorems for infinite graphs and infinite abstract separation systems.

Recommendations

• Trees of tangles in abstract separation systems
• A tree-of-tangles theorem for infinite tangles
• Tangle-tree duality in abstract separation systems
• On trees, tanglegrams, and tangled chains
• Tangles and the Stone-Čech compactification of infinite graphs
• Obtaining trees of tangles from tangle-tree duality
• Inducibility in binary trees and crossings in random tanglegrams
• Infinite towers of tree lattices
• Tangles, tree-decompositions and grids in matroids
• Tangle-tree duality: in graphs, matroids and beyond

Cites work

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

Cited in

(4)

• Infinite towers of tree lattices
• Can you tell a tree from its branches?
• A note on the structure of locally finite planar quasi-transitive graphs
• Characterising 4-tangles through a connectivity property

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

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