Abstract
Oxley has conjectured that for k≥4, if a matroid M has a k-element set that is the intersection of a circuit and a cocircuit, then M has a (k−2)-element set that is the intersection of a circuit and a cocircuit. In this paper we prove a stronger version of this conjecture for regular matroids. We also show that the stronger result does not hold for binary matroids.
Similar content being viewed by others
References
Kingan, S. R.: Intersections of circuits and cocircuits in binary matroids, Discrete Math. 195, 157–165 (1999)
Oxley, J. G.: On the intersections of circuits and cocircuits in matroids, Combinatorica 4, 187–195 (1984)
Oxley, J. G.: Matroid Theory, (Oxford Science Publications) Oxford University Press, New York: 1992
Seymour, P. D.: The forbidden minors of binary clutters. J. London Math. Soc. 12(2), 356–360 (1976)
Seymour, P. D.: Decomposition of regular matroids. J. Combin. Theory Ser. B 28, 305–359 (1980)
Author information
Authors and Affiliations
Corresponding author
Additional information
The second author was partially supported by CNPq (grant no 302195/02-5) and the ProNEx/CNPq (grant no 664107/97-4).
Rights and permissions
About this article
Cite this article
Kingan, S., Lemos, M. On the Circuit-cocircuit Intersection Conjecture. Graphs and Combinatorics 22, 471–480 (2006). https://doi.org/10.1007/s00373-006-0680-1
Received:
Accepted:
Issue Date:
DOI: https://doi.org/10.1007/s00373-006-0680-1