Hostname: page-component-848d4c4894-5nwft Total loading time: 0 Render date: 2024-06-06T21:43:20.361Z Has data issue: false hasContentIssue false
  • English
  • Français

On Dependence in Matroids

Published online by Cambridge University Press:  20 November 2018

D.J.A. Welsh
D.J.A. Welsh*
Affiliation:
Merton College, Oxford
Rights & Permissions [Opens in a new window]

Extract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

In this note we study dependence in matroids as an exercise in combinational algebra. Because the work seems to have little connection with graph theory we will not use Tutte′s approach (1) which uses dual concepts. To define a matroid we use Edmunds (2).

Type
Research Article
Information
Canadian Mathematical Bulletin , Volume 10 , Issue 4 , October 1967 , pp. 599 - 603
Copyright
Copyright © Canadian Mathematical Society 1967

References

1. Tutte, W. T., Lectures on Matroids, J. Res. NBS 69B 1-47, (1966).Google Scholar
2. Edmunds, J., Minimum Partition of a Matroid into Independent Subsets, J. Res. NBS 69B 67-72 (1966).Google Scholar
3. Edmunds, J. and Fulkerson, D. R., Transversals and Matroid Partition, J. Res. NBS 69B 147-153 (1966).Google Scholar
4. Whitney, H., The Abstract Properties of Linear Dependence, Amer. J. Math. 57 507-533 (1933).Google Scholar