Profiles of Separations: in Graphs, Matroids, and Beyond
We show 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. This comes as a corollary of a similar decomposition theorem for more general combina- torial structures, which has further applications.
These include a new approach to cluster analysis and image segmentation. As another illustration for the abstract theorem, we show that applying it to edge-tangles yields the Gomory-Hu theorem.
Mathematics Subject Classification (2010)05C05 05C40 05C83 05B35 06A07
Unable to display preview. Download preview PDF.
- R. Diestel and S. Oum: Tangle-tree duality in abstract separation systems, arXiv:1701.02509, 2017.Google Scholar
- R. Diestel and S. Oum: Tangle-tree duality in graphs, matroids and beyond, arXiv:1701.02651, 2017.Google Scholar
- R. Diestel and G. Whittle: Tangles and the Mona Lisa, arXiv:1603.06652.Google Scholar
- P. Eberenz: Characteristics of profiles, MSc dissertation, Hamburg 2015.Google Scholar
- F. Hundertmark: Profiles. An algebraic approach to combinatorial connectivity, https://archive.org/stream/arxiv-1110.6207/1110.6207, 2011.Google Scholar