Hostname: page-component-586b7cd67f-vdxz6 Total loading time: 0 Render date: 2024-12-03T07:18:06.195Z Has data issue: false hasContentIssue false
  • English
  • Français

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

Published online by Cambridge University Press:  01 November 1999

TRISTAN DENLEY  and
TALMAGE JAMES REID
TRISTAN DENLEY
Affiliation:
Department of Mathematics, The University of Mississippi, University, MS 38677, USA (e-mail: [email protected], [email protected])
TALMAGE JAMES REID
Affiliation:
Department of Mathematics, The University of Mississippi, University, MS 38677, USA (e-mail: [email protected], [email protected])
Get access Rights & Permissions [Opens in a new window]

Abstract

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.

Type
Research Article
Information
Combinatorics, Probability and Computing , Volume 8 , Issue 6 , November 1999 , pp. 529 - 537
Copyright
© 1999 Cambridge University Press

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)