We prove a general duality theorem for width parameters in combinatorial structures such as graphs and matroids. It implies the classical such theorems for path-width, tree-width, branch-width and rankwidth, and gives rise to new width parameters with associated duality theorems. The dense substructures witnessing large width are presented in a unified way akin to tangles, as orientations of separation systems satisfying certain consistency axioms.
CITATION STYLE
Diestel, R., & Oum, S. I. (2014). Unifying duality theorems for width parameters in graphs and matroids (Extended abstract). In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8747, pp. 1–14). Springer Verlag. https://doi.org/10.1007/978-3-319-12340-0_1
Mendeley helps you to discover research relevant for your work.