On large circuits in matroids (Q5943055)

Let \(\mathcal{M}\) be a simple matroid with at least two elements and let \(C\) be a maximum-sized circuit of \(\mathcal{M}.\) The author proves that (1) for \(k\in \{2,3\}\) every element of \(\mathcal{M}\) is contained in a circuit of size at least \(\lceil C/2 \rceil+k-1\), if \({\mathcal M}\) is \(k\)-connected and (2) every pair of elements is contained in a circuit of size at least \(\Big{\lceil} \sqrt{|C|-2} \Big{\rceil} +2\) when \({\mathcal M}\) is 3-connected and graphic. Examples are given to show that these results are sharp.