# Minimum rank graph cut

Consider the following problem:

Input: A graph $$G=(V,E)$$ and a matroid $$M$$ on $$E$$, given by an independence oracle.

Task: Find a cut $$C\subseteq E$$ in the graph, such that the rank of $$C$$ in the matroid is minimum.