Wei-type duality theorems for matroids
We present several fundamental duality theorems for matroids and more general combinatorial structures. As a special case, these results show that the maximal cardinalities of fixed-ranked sets of a matroid determine the corresponding maximal cardinalities of the dual matroid. Our main results are applied to perfect matroid designs, graphs, transversals, and linear codes over division rings, in each case yielding a duality theorem for the respective class of objects.
CitationDesigns, Codes and Cryptography 62(2012) nr. 3 s. 331-341
MetadataShow full item record
The following license file are associated with this item: