Skip to main content
Log in

A matroid generalization of a result of Dirac

  • Published:
Combinatorica Aims and scope Submit manuscript

Abstract

This paper generalizes a theorem of Dirac for graphs by proving that ifM is a 3-connected matroid, then, for all pairs {a,b} of distinct elements ofM and all cocircuitsC * ofM, there is a circuit that contains {a,b} and meetsC *. It is also shown that, although the converse of this result fails, the specified condition can be used to characterize 3-connected matroids.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. R. E. Bixby: A simple theorem on 3-connectivity,Linear Algebra Appl.,45 (1982), 123–126.

    Google Scholar 

  2. G. A. Dirac: In abstrakten Graphen vorhande vollständige 4-Graphen und ihre Unterteilungen,Math. Nachr.,22 (1960), 61–85.

    Google Scholar 

  3. J. G. Oxley:Matroid Theory, Oxford University Press, New York, 1992.

    Google Scholar 

  4. P. D. Seymour: Triples in matroid circuits,Europ. J. Combin.,7 (1986) 177–185.

    Google Scholar 

  5. W. T. Tutte: connectivity in matroids,Canad. J. Math. 18 (1966), 1301–1324.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Additional information

The author's research was partially supported by a grant from the National Security Agency.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Oxley, J. A matroid generalization of a result of Dirac. Combinatorica 17, 267–273 (1997). https://doi.org/10.1007/BF01200909

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01200909

Mathematics Subject Classification (1991)

Navigation