Unifying duality theorems for width parameters in graphs and matroids. II. General duality
classification
🧮 math.CO
keywords
dualitygeneralgraphsmatroidsassumescombinatorialcontinuesdense
read the original 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]
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.