Displaying tangles and non-sequential separations
Combinatorics
2016-05-23 v1
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.
Keywords
Cite
@article{arxiv.1605.06139,
title = {Displaying tangles and non-sequential separations},
author = {Ben Clark},
journal= {arXiv preprint arXiv:1605.06139},
year = {2016}
}
Comments
9 pages. arXiv admin note: text overlap with arXiv:1109.1048