Profinite separation systems
From MaRDI portal
Publication:2183105
Abstract: Separation systems are posets with additional structure that form an abstract setting in which tangle-like clusters in graphs, matroids and other combinatorial structures can be expressed and studied. This paper offers some basic theory about infinite separation systems and how they relate to the finite separation systems they induce. They can be used to prove tangle-type duality theorems for infinite graphs and matroids, which will be done in future work that will build on this paper.
Recommendations
Cites work
Cited in
(8)- Tangle-tree duality in abstract separation systems
- Trees of tangles in infinite separation systems
- Structural submodularity and tangles in abstract separation systems
- Abstract separation systems
- Tree sets
- Trees of tangles in abstract separation systems
- Characterising \(k\)-connected sets in infinite graphs
- Separations of sets
This page was built for publication: Profinite separation systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2183105)