Unifying duality theorems for width parameters in graphs and matroids.   II. General duality
  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] 
Reinhard Diestel and Sang-il Oum
math.CO