Explore relationships

Matroid intersection

In combinatorial optimization, the matroid intersection problem is to find a largest common independent set in two matroids over the same ground set.

Use + to expand a branch. Click a topic name to open its summary.