Unifying duality theorems for width parameters in graphs and matroids. II. General duality

2014/06/15 by Reinhard Diestel, Sang-il Oum, Diestel, Reinhard +2 · 1 citation
Computer Science · Mathematics · #Advanced Graph Theory Research #Combinatorics (math.CO) #Computational Geometry and Mesh Generation #FOS: Mathematics #Limits and Structures in Graph Theory #math.CO

paper · pdf · doi:10.48550/arxiv.1406.3798

19 pages

arxiv created 2014/06/15 · openalex publication_date 2014/06/15 · arxiv updated 2014/06/17 · openalex created_date 2016/06/24 · openalex updated_date 2026/07/28

Abstract

We prove a general duality theorem for tangle-like dense objects in combinatorial structures such as graphs and matroids. This paper continues, and assumes familiarity with, the theory developed in [6]

Citations

• Profiles of separations: in graphs, matroids and beyond

Cited by

• Tangled up in Blue (A Survey on Connectivity, Decompositions, and\n Tangles)

Related

• Duality theorems for blocks and tangles in graphs
• Decomposition width - a new width parameter for matroids
• A simple proof of the tree-width duality theorem
• Amalgam width of matroids
• On objects dual to tree-cut decompositions