Hostname: page-component-cd9895bd7-gvvz8 Total loading time: 0 Render date: 2024-12-24T17:01:53.564Z Has data issue: false hasContentIssue false
  • English
  • Français

A circuit covering result for matroids

Published online by Cambridge University Press:  24 October 2008

J. H. Mason  and
J. G. Oxley
J. H. Mason
Affiliation:
The Open University, Milton Keynes
J. G. Oxley
Affiliation:
Australian National University, Canberra
Get access Rights & Permissions [Opens in a new window]

Extract

The purpose of this note is to prove the following result.

Theorem 1. let M be a connected matroid. Suppose that C is a circuit of M and p and q are elements of M. Then M has circuits cp and Cq such that .

Type
Research Article
Information
Mathematical Proceedings of the Cambridge Philosophical Society , Volume 87 , Issue 1 , January 1980 , pp. 25 - 27
Copyright
Copyright © Cambridge Philosophical Society 1980

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.)

References

REFERENCES

(1)Lehman, Alfred. A solution of the Shannon switching game. J. Soc. Indust. Appl. Math. 12 (1964), 687–725.CrossRefGoogle Scholar
(2)Tutte, W. T.Connectivity in matroids. Canad. J. Math. 18 (1966), 1301–1324.CrossRefGoogle Scholar
(3)Welsh, D. J. A.Matroid theory (London Math. Soc. Monographs No. 8). (London, New York, San Francisco, Academic Press, 1976.)Google Scholar