Pairs of largest circuits in 3-connected matroids Original Research Article

Smith conjectured that two distinct longest cycles of a k-connected graph meet in at least k vertices when kgreater-or-equal, slanted2. We prove an extension of this conjecture for 3-connected matroids.