Trees of tangles in abstract separation systems

DOI10.1016/J.JCTA.2021.105425MaRDI QIDQ2229193zbMATH OpenOpenAlexFDO

Authors Christian Elbracht, Jakob Kneip, Maximilian Teegen

Publication date 22 February 2021

Published in Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

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

zbMATH Keywords

abstract separation systemstanglestree-decompositionstree-structure

Mathematics Subject Classification ID

Trees (05C05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph minors (05C83)

Abstract: We prove canonical and non-canonical tree-of-tangles theorems for abstract separation systems that are merely structurally submodular. Our results imply all known tree-of-tangles theorems for graphs, matroids and abstract separation systems with submodular order functions, with greatly simplified and shortened proofs.

Recommendations

• Structural submodularity and tangles in abstract separation systems
• Obtaining trees of tangles from tangle-tree duality
• Abstract separation systems
• Profinite separation systems
• Tangle-tree duality in abstract separation systems

Cites work

• A short proof that every finite graph has a tree-decomposition displaying its tangles
• Abstract separation systems
• An introduction to clique minimal separator decomposition
• Connectivity and tree structure in finite graphs
• Decomposition by clique separators
• Duality theorems for blocks and tangles in graphs
• Graph minors. X: Obstructions to tree-decomposition
• Graph theory
• Optimal decomposition by clique separators
• Profiles of separations: in graphs, matroids, and beyond
• Profinite separation systems
• Separations of sets
• Structural submodularity and tangles in abstract separation systems
• Tangle-tree duality in abstract separation systems
• Tangle-tree duality: in graphs, matroids and beyond
• Tree sets
• Über eine Eigenschaft der ebenen Komplexe
• Über simpliziale Zerfällungen beliebiger (endlicher oder unendlicher) Graphen

Cited in

(16)

• A tree-of-tangles theorem for infinite tangles
• Profinite separation systems
• Tangle-tree duality in abstract separation systems
• Structural submodularity and tangles in abstract separation systems
• Tangle-tree duality: in graphs, matroids and beyond
• Abstract separation systems
• Tree sets
• Profiles of separations: in graphs, matroids, and beyond
• Obtaining trees of tangles from tangle-tree duality
• Trees of tangles in infinite separation systems
• Entanglements
• Refining trees of tangles in abstract separation systems: inessential parts
• Characterising 4-tangles through a connectivity property
• Refining tree-decompositions so that they display the k-blocks
• Untangling Gaussian mixtures
• Separations of sets

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

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