Removable Circuits in Binary Matroids
Luis Goddyn, Bill Jackson · Combinatorics Probability Computing · 1999
We show that, if M is a connected binary matroid of cogirth at least five which does not have both an F7-minor and an F*7-minor, then M has a circuit C such that M − C is connected and r(M − C) = r(M).