Matroid parity problem
Largest independent set of paired elements
In combinatorial optimization, the matroid parity problem is a problem of finding the largest independent set of paired elements in a matroid, a structure that abstracts and generalizes the notion of linear independence in vector spaces.
