Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
J. Carmesin, R. Diestel, M. Hamann and F. Hundertmark: k-Blocks: a connectivity invariant for graphs, SIAM J. Discrete Math. 28 (2014), 1876–1891.
J. Carmesin, R. Diestel, M. Hamann and F. Hundertmark: Canonical tree-decompositions of finite graphs I. Existence and algorithms, J. Combin. Theory Ser. B 116 (2016), 1–24.
J. Carmesin, R. Diestel, M. Hamann and F. Hundertmark: Canonical tree-decompositions of finite graphs II. Essential parts, J. Combin. Theory Ser. B 118 (2016), 268–283.
J. Carmesin, R. Diestel, F. Hundertmark and M. Stein: Connectivity and tree structure in finite graphs, Combinatorica 34 (2014), 1–35.
R. Diestel: Graph Theory (5th edition, 2016), Springer-Verlag, 2017. Electronic edition available at http://diestel-graph-theory.com/.
R. Diestel: Abstract separation systems, Order 35 (2018), 157–170.
R. Diestel: Tree sets, Order 35 (2018), 171–192.
R. Diestel, J. Erde and P. Eberenz: Duality theorem for blocks and tangles in graphs, SIAM J. Discrete Math. 31 (2017), 1514–1528.
R. Diestel and S. Oum: Tangle-tree duality in abstract separation systems, arXiv:1701.02509, 2017.
R. Diestel and S. Oum: Tangle-tree duality in graphs, matroids and beyond, arXiv:1701.02651, 2017.
R. Diestel and G. Whittle: Tangles and the Mona Lisa, arXiv:1603.06652.
P. Eberenz: Characteristics of profiles, MSc dissertation, Hamburg 2015.
A. Frank: Connections in Combinatorial Optimization, Oxford University Press, 2011.
J. Geelen, B. Gerards, N. Robertson and G. Whittle: Obstructions to branch- decomposition of matroids, J. Combin. Theory (Series B) 96 (2006), 560–570.
J. Geelen, B. Gerards and G. Whittle: Tangles, tree-decompositions and grids in matroids, J. Combin. Theory (Series B) 99 (2009), 657–667.
R. E. Gomory and T. C. Hu: Multi-terminal network flows, J. Soc. Ind. Appl. Math. 9 (1961), 551–570.
M. Grohe: Quasi-4-connected components, arXiv:1602.04505, 2016.
F. Hundertmark: Profiles. An algebraic approach to combinatorial connectivity, https://archive.org/stream/arxiv-1110.6207/1110.6207, 2011.
J. Oxley: Matroid Theory, Oxford University Press, 1992.
N. Robertson and P. Seymour: Graph minors. X. Obstructions to tree- decomposition, J. Combin. Theory (Series B) 52 (1991), 153–190.
W. T. Tutte: Graph Theory, Addison-Wesley, 1984.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Diestel, R., Hundertmark, F. & Lemanczyk, S. Profiles of Separations: in Graphs, Matroids, and Beyond. Combinatorica 39, 37–75 (2019). https://doi.org/10.1007/s00493-017-3595-y
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00493-017-3595-y