Tangles, trees, and flowers

Details Tangles, trees, and flowers Tangles, trees, and flowers

2011-09-06

arxiv.org/abs/1109.1048v1

Mathematics

Combinatorics

31 pages, 1 figure

Scientific paper

A tangle of order $k$ in a matroid or graph may be thought of as a "$k$-connected component". For a tangle of order $k$ 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 $k$-separations of the matroid or graph that are non-trivial with respect to the tangle.

Affiliated with

Also associated with

No associations

Rating

Tangles, trees, and flowers does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Tangles, trees, and flowers, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Tangles, trees, and flowers will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-92701