Tangles, trees, and flowers
Combinatorics
2011-09-07 v1
Abstract
A tangle of order in a matroid or graph may be thought of as a "-connected component". For a tangle of order in a matroid or graph that satisfies a certain robustness condition, we describe a tree decomposition of the matroid or graph that displays, up to a certain natural equivalence, all of the -separations of the matroid or graph that are non-trivial with respect to the tangle.
Cite
@article{arxiv.1109.1048,
title = {Tangles, trees, and flowers},
author = {Ben Clark and Geoff Whittle},
journal= {arXiv preprint arXiv:1109.1048},
year = {2011}
}
Comments
31 pages, 1 figure