Generalized matroid matching

Abstract The matroid parity problem is known to be unsolvable in polynomial time in the general case and is polynomial for linearly represented matroids. Its generalization asks if there exists an independent set in a matroid, intersecting k-tuples in a given way. The known polynomial, non-polynomial and NP-hard special cases are summarized and some open cases are mentioned.