On the Number of Elements in Matroids with Small Circuits or Cocircuits
Tristan M. J. Denley, Talmage James Reid · Combinatorics Probability Computing · 1999
It has been conjectured that a connected matroid with largest circuit size c [ges ] 2 and largest cocircuit size c* [ges ] 2 has at most ½cc* elements. Pou-Lin Wu has shown that this conjecture holds for graphic matroids. We prove two special cases of the conjecture, not restricted to graphic matroids, thereby providing the first nontrivial evidence that the conjecture is true for non-graphic matroids. Specifically, we prove the special case of the conjecture in which c = 4 or c* = 4. We also prove the special case for binary matroids with c = 5 or c* = 5.