This paper generalizes a theorem of Dirac for graphs by proving that i
f M is a 3-connected matroid, then, for all pairs {a, b} of distinct e
lements of M and all cocircuits C of M, there is a circuit that conta
ins {a, b} and meets C. It is also shown that, although the converse
of this result fails, the specified condition call be used to characte
rize 3-connected matroids.