ISSN:
1439-6912
Keywords:
05 B 35
Source:
Springer Online Journal Archives 1860-2000
Topics:
Mathematics
Notes:
Abstract The matroid matching problem (also known as matroid parity problem) has been intensively studied by several authors. Starting from very special problems, in particular the matching problem and the matroid intersection problem, good characterizations have been obtained for more and more general classes of matroids. The two most recent ones are the class of representable matroids and, later on, the class of algebraic matroids (cf. [4] and [2]). We present a further step of generalization, showing that a good characterization can also be obtained for the class of socalled pseudomodular matroids, introduced by Björner and Lovász (cf. [1]). A small counterexample is included to show that pseudomodularity still does not cover all matroids that behave well with respect to matroid matching.
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1007/BF02124676
Permalink
