Rank Formula for Cycle Matroids is a result in [matroid theory](/page/Matroid%20Theory). It formalizes the assertion that let be a finite graph with vertex set and edge set , and let denote the cycle matroid of on ground set . For each subset , let denote the number of connected components of the spanning subgraph . Then the rank function of satisfies.