Displaying tangles and non-sequential separations
From MaRDI portal
Abstract: We show that, for any graph or matroid, there is a tree that simultaneously distinguishes its maximal tangles, and, for each maximal tangle that satisfies an additional robustness condition, displays all of the non-trivial separations relative to , up to a natural equivalence.
This page was built for publication: Displaying tangles and non-sequential separations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6273707)
