Profiles of separations: in graphs, matroids, and beyond (Q2416510): Difference between revisions

Using a similar decomposition theorem, the author shows that all the tangles in a finite graph or matroid can be distinguished by a single tree-decomposition that is invariant under the automorphisms of the graph or matroid. A non-canonical tangle-tree theorem for separation universes is proved. Applying it to edge-tangles yields the Gomory-Hu theorem.