Largest circuits in matroids

We extend to matroids Smith's Conjecture that any two distinct longest cycles of a k-connected graph meet in at least k vertices when k⩾2. We generalize several known results for graphs and matroids by proving the matroid conjecture in the case that k=2.