Year: 2016
Type: preprint
Abstract: We show that, for any graph or matroid, there is a tree that simultaneously distinguishes its maximal tangles, and, for each maximal tangle $\mathcal{T}$ that satisfies an additional robustness condition, displays all of the non-trivial separations relative to $\mathcal{T}$, up to a natural equivalence.
Source: arXiv (Cornell University)
Author: Clark, Ben
Institution: Louisiana State University
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W2394902334