Pairs of largest circuits in 3-connected matroids

Abstract Smith conjectured that two distinct longest cycles of a k -connected graph meet in at least k vertices when k ⩾ 2 . We prove an extension of this conjecture for 3-connected matroids.