Compatibility of Graphic Matroid Minors with Graph Minors is a result in [matroid theory](/page/Matroid%20Theory). It formalizes the assertion that let be a finite graph, allowing loops and parallel edges, and let . Let denote the graphic matroid on ground set , whose independent sets are precisely the edge subsets such that the spanning subgraph is a forest. Then, under the natural.