Profiles of separations: in graphs, matroids, and beyond (Q2416510): Difference between revisions
From MaRDI portal
Set profile property. |
Changed an Item |
||
(One intermediate revision by one other user not shown) | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2528746591 / rank | |||
Normal rank | |||
Property / arXiv ID | |||
Property / arXiv ID: 1110.6207 / rank | |||
Normal rank |
Latest revision as of 06:44, 19 April 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Profiles of separations: in graphs, matroids, and beyond |
scientific article |
Statements
Profiles of separations: in graphs, matroids, and beyond (English)
0 references
23 May 2019
0 references
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.
0 references
tree-decomposition
0 references
oriented separation
0 references
matroid
0 references
distinguishable tangles
0 references