Abstract
In this note, we study a constrained independent set problem for matroids. The problem can be regarded as an ordered version of the matroid parity problem. By a reduction of this problem to matroid intersection, we prove a min–max formula. We show how earlier results of Hefner and Kleinschmidt on the so-called MS-matchings fit in our framework.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have