Displaying tangles and non-sequential separations
Abstract
We show that, for any graph or matroid, there is a tree that simultaneously distinguishes its maximal tangles, and, for each maximal tangle T that satisfies an additional robustness condition, displays all of the non-trivial separations relative to T, up to a natural equivalence.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.