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. If the elements of the matroid are assigned real weights, the weighted matroid intersection problem is to find a common independent set with the maximum possible weight. These problems generalize many problems in combinatorial optimization including finding maximum matchings and maximum weight matchings in bipartite graphs and finding arborescences in directed graphs.

The matroid intersection theorem, due to Jack Edmonds,^[1] says that there is always a simple upper bound certificate, consisting of a partitioning of the ground set amongst the two matroids, whose value (sum of respective ranks) equals the size of a maximum common independent set. In other words, for any two matroids ${\displaystyle M_{1}=(E,{\mathcal {I}}_{1})}$ and ${\displaystyle M_{2}=(E,{\mathcal {I}}_{2})}$ we have

${\displaystyle \max _{I\in {\mathcal {I}}_{1}\cap {\mathcal {I}}_{2}}|I|=\min _{A\subseteq E}(r_{1}(A)+r_{2}(E\setminus A))}$

where ${\displaystyle r_{1}}$ and ${\displaystyle r_{2}}$ are the respective rank functions of ${\displaystyle M_{1}}$ and ${\displaystyle M_{2}}$.

Based on this theorem, the matroid intersection problem for two matroids can be solved in polynomial time using matroid partitioning algorithms.