Removing circuits in 3-connected binary matroids

For a k -connected graph or matroid M , where k is a fixed positive integer, we say that a subset X of E ( M ) is k -removable provided M ∖ X is k -connected. In this paper, we obtain a sharp condition on the size of a 3-connected binary matroid to have a 3-removable circuit.