Hostname: page-component-cd9895bd7-7cvxr Total loading time: 0 Render date: 2024-12-25T12:59:23.462Z Has data issue: false hasContentIssue false
  • English
  • Français

Cocircuit coverings and packings for binary matroids

Published online by Cambridge University Press:  24 October 2008

James G. Oxley
James G. Oxley
Affiliation:
Mathematical Institute, Oxford
Get access Rights & Permissions [Opens in a new window]

Extract

If M is an arbitrary loopless matroid with ground set E(M) and rank function ρ, then let α(M) be the minimum size of a set of cocircuits of M, whose union is E(M), and let β(M) be the maximum size of a set of pairwise disjoint cocircuits of M. The following conjecture is based on Gallai's theorem that the vertex-stability and vertex-covering numbers of a graph G sum to the number of vertices of G (1).

Type
Research Article
Information
Mathematical Proceedings of the Cambridge Philosophical Society , Volume 83 , Issue 3 , May 1978 , pp. 347 - 351
Copyright
Copyright © Cambridge Philosophical Society 1978

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)Gallai, T.Über extreme Punkt- und Kantenmengen. Ann. Univ. Sci. Budapest Eötvös Sect. Math. 2 (1959), 133–138.Google Scholar
(2)Harary, F.Graph theory (Reading, Mass.; Menlo Park, Calif.; London: Addison-Wesley, 1969).CrossRefGoogle Scholar
(3)Matthews, L. R.Bicircular matroids. Quart. J. Math. Oxford, Ser. (2), 28 (1977), 213–227.CrossRefGoogle Scholar
(4)Oxley, J. G.Colouring, packing and the critical problem. Quart. J. Math. Oxford, Ser. (2), 29 (1978) (to appear).CrossRefGoogle Scholar
(5)Welsh, D. J. A.Matroid theory (London, New York, San Francisco: Academic Press, 1976). 353Google Scholar