On the Number of Elements in Matroids with Small Circuits or Cocircuits

Authors:
Tristan Denley;Talmage James Reid
Affiliations:
Department of Mathematics, The University of Mississippi, University, MS 38677, USA (e-mail: denley@hilbert.math.olemiss.edu, mmreid@sunset.backbone.olemiss.edu);Department of Mathematics, The University of Mississippi, University, MS 38677, USA (e-mail: denley@hilbert.math.olemiss.edu, mmreid@sunset.backbone.olemiss.edu)
Venue:
Combinatorics, Probability and Computing
Year:
1999

Citing 5
Cited 0

Typical subgraphs of 3- and 4-connected graphs

Journal of Combinatorial Theory Series B
Unavoidable minors of large 3-connected binary matroids

Journal of Combinatorial Theory Series B
Ramsey numbers for matroids

European Journal of Combinatorics
The Matroid Ramsey Number n(6,6)

Combinatorics, Probability and Computing
An Upper Bound on the Number of Edges of a 2-Connected Graph

Combinatorics, Probability and Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

It has been conjectured that a connected matroid with largest circuit size c ≥ 2 and largest cocircuit size c* ≥ 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.