Intersections of circuits and cocircuits in binary matroids
Oxley has shown that if, for some \(k\geq 4\), a matroid \(M\) has a \(k\)-element set that is the intersection of a circuit and cocircuit, then \(M\) has a 4-element set that is the intersection of a circuit and a cocircuit. In the paper, it is proved that, under the above hypothesis, for \(k\geq 6\), a binary matroid also has a 6-element set that is the intersection of a circuit and a cocircuit. In addition, the regular matroids which do not have a 6-element set that is the intersection of a circuit and cocircuit are determined. Finally, in the case of graphs, it is shown that, if, for some \(k\geq 4\), a circuit and a cocircuit intersect in \(k\) elements, then there must be a circuit and a cocircuit that intersect in \((k-2)\) elements.
- Binary matroids without prisms, prism duals, and cubes
- Decomposition of regular matroids
- Minors of 3-connected matroids
- On minors of non-binary matroids
- On the intersections of circuits and cocircuits in matroids
- Some Results Concerning the Structure of Graphs
- The Binary Matroids With No 4-Wheel Minor
- The Forbidden Minors of Binary Clutters
- k-elimination property for circuits of matroids
- Large circuits in binary matroids of large cogirth. II
- On the circuit-spectrum of binary matroids
- Matroids with every two elements in a 4-circuit.
- Circuit and cocircuit partitions of binary matroids
- Nonseparating Cocircuits in Binary Matroids
- On binary matroids not isomorphic to their base matroids
- On the intersections of circuits and cocircuits in matroids
- On the circuit-cocircuit intersection conjecture
This page was built for publication: Intersections of circuits and cocircuits in binary matroids
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1296980)
