Unifying duality theorems for width parameters in graphs and matroids. II. General duality
Combinatorics
2014-06-17 v1
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]
Cite
@article{arxiv.1406.3798,
title = {Unifying duality theorems for width parameters in graphs and matroids. II. General duality},
author = {Reinhard Diestel and Sang-il Oum},
journal= {arXiv preprint arXiv:1406.3798},
year = {2014}
}
Comments
19 pages