Hostname: page-component-cd9895bd7-q99xh Total loading time: 0 Render date: 2024-12-25T01:30:02.123Z Has data issue: false hasContentIssue false
  • English
  • Français

Kruskal's theorem for matroids

Published online by Cambridge University Press:  24 October 2008

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

Abstract

Kruskal's theorem for obtaining a minimal (maximal) spanning tree of a graph is shown to be a special case of a more general theorem for matroid spaces in which each element of the matroid has an associated weight. Since any finite subset of a vector space can be regarded as a matroid space this theorem gives an easy method of selecting a linearly independent set of vectors of minimal (maximal) weight.

Type
Research Article
Information
Mathematical Proceedings of the Cambridge Philosophical Society , Volume 64 , Issue 1 , January 1968 , pp. 3 - 4
Copyright
Copyright © Cambridge Philosophical Society 1968

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)Whitney, H.On the abstract properties of linear dependence. Amer. J. Math. 57 (1935), 509–533.CrossRefGoogle Scholar
(2)Nash-Williams, C. St. J. A. An application of matroids to graph theory (abstract). Int. Sem. on Graph Theory, p. 7 (Rome, 1966).Google Scholar
(3)Tutte, W. T.Lectures on matroids. J. Res. Nat. Bur. Standards 69 sect. B (Math. and Math. Phys.), no. 1 (1965).Google Scholar
(4)Edmunds, J.Minimum partition of a matroid into independent subsets. J. Res. Nat. Bur. Standards 69 sect. 13 (Math. and Math. Phys.) no. 1, (1965), 67–72.CrossRefGoogle Scholar
(5)Nash-Williams, C. St. J. A.Edge-disjoint spanning trees of finite graphs. J. London Math. Soc. 36 (1961), 445–450.CrossRefGoogle Scholar
(6)Tutte, W. T.On the problem of decomposing a graph into n-connected factors. J. London Math. Soc. 36 (1961), 221–230.CrossRefGoogle Scholar
(7)Tutte, W. T.Menger's theorem for matroids. J. Res. Nat. Bur. Standards 69 sect. B (Math. and Math. Phys.) (1965), no. 1, 49–53.CrossRefGoogle Scholar
(8)Kruskal, J. B.On the shortest spanning subtree of a graph and the travelling salesman problem. Proc. Amer. Math. Soc. 7 (1956), 48–50.CrossRefGoogle Scholar