Matroids having small circumference
From MaRDI portal
For a matroid \(M\) which is not free, the circumference of \(M\) is the maximum cardinality of a circuit of \(M.\) In recent years, the circumference of a matroid has appeared in some bounds. This paper determines all the matroids of circumference at most five. The authors' main result proves, in the special case of \(d=3,\) a conjecture of \textit{W. Hochstättler} and \textit{B. Jackson} [J. Comb. Theory, Ser. B 74, 53-63 (1998; Zbl 0913.05033)] for \(d\)-connected simple binary matroids.
Recommendations
- Connected matroids with a small circumference
- Matroids with many small circuits and cocircuits
- Small cocircuits in matroids
- Simple matroids with bounded cocircuit size
- On the Number of Elements in Matroids with Small Circuits or Cocircuits
- scientific article; zbMATH DE number 3970763
- Matroids with the circuit cover property
- The smallest rounded sets of binary matroids
- On matroids with few circuits containing a pair of elements
- Cyclic Matroids
Cited in
(10)- The 3-connected binary matroids with circumference 6 or 7
- Connected matroids with a small circumference
- The smallest matroids with no large independent flat
- On the circuit-spectrum of binary matroids
- Characterizations of matroids with an element lying in a restricted number of circuits
- An upper bound for the circumference of a 3-connected binary matroid
- scientific article; zbMATH DE number 3970763 (Why is no real title available?)
- The 3-connected binary matroids with circumference 8. I
- Relations between the circumference and \(e\)-circumference of a matroid
- The 3-connected matroids with circumference 6
This page was built for publication: Matroids having small circumference
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2757077)
