Abstract separation systems
From MaRDI portal
Publication:2413419
Abstract: Abstract separation systems provide a simple general framework in which both tree-shape and high cohesion of many combinatorial structures can be expressed, and their duality proved. Applications range from tangle-type duality and tree structure theorems in graphs, matroids or CW-complexes to, potentially, image segmentation and cluster analysis. This paper is intended as a concise common reference for the basic definitions and facts about abstract separation systems in these and any future papers using this framework.
Recommendations
Cites work
- Canonical tree-decompositions of finite graphs. I: Existence and algorithms.
- Connectivity and tree structure in finite graphs
- Duality theorems for blocks and tangles in graphs
- Graph minors. X: Obstructions to tree-decomposition
- Graph theory
- Profiles of separations: in graphs, matroids, and beyond
- Tangle-tree duality in abstract separation systems
- Tangle-tree duality: in graphs, matroids and beyond
- Tree sets
Cited in
(24)- Separation in homogeneous systems with independent identical elements
- A tree-of-tangles theorem for infinite tangles
- Every infinitely edge-connected graph contains the Farey graph or \({T_{\aleph_0}\ast t}\) as a minor
- Graph theory -- a survey on the occasion of the Abel Prize for László Lovász
- On objects dual to tree-cut decompositions
- Profinite separation systems
- Tangle-tree duality in abstract separation systems
- Tangles and the Stone-Čech compactification of infinite graphs
- Trees of tangles in abstract separation systems
- Structural submodularity and tangles in abstract separation systems
- Tree sets
- Representations of infinite tree sets
- A canonical tree-of-tangles theorem for structurally submodular separation systems
- Trees of tangles in infinite separation systems
- Duality theorems for blocks and tangles in graphs
- Entanglements
- Efficiently distinguishing all tangles in locally finite graphs
- Refining trees of tangles in abstract separation systems: inessential parts
- Characterising 4-tangles through a connectivity property
- Approximating branchwidth on parametric extensions of planarity
- Untangling Gaussian mixtures
- Approximating branchwidth on parametric extensions of planarity
- Optimal trees of tangles: refining the essential parts
- Separations of sets
This page was built for publication: Abstract separation systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2413419)
