Concepedia

Minimum partition of a matroid into independent subsets

Jack Edmonds

Journal of Research of the National Bureau of Standards Section B Mathematics and Mathematical Physics · 1965 · 449 citations · 5 references

DOIFull text

Open access

Concepts

Abstract

A matroid M is a finit e se t M of e le me nts with a famil y of subsets, calle d inde pe nde nt, s uc h th a t (I) every su bset of an ind e pe nd e nt se t is indepe nde nt, and ( r(A ).

References

5

Edge-Disjoint Spanning Trees of Finite Graphs

C. St. J. A. Nash‐Williams · Journal of the London Mathematical Society · 1961 · 805 citations

, , +7

On the Abstract Properties of Linear Dependence

Hassler Whitney · American Journal of Mathematics · 1935 · 719 citations

, , +8

On the Problem of Decomposing a Graph into <i>n</i> Connected Factors

W. T. Tutte · Journal of the London Mathematical Society · 1961 · 669 citations

, , +7

Decomposition of Finite Graphs Into Forests

C. St. J. A. Nash‐Williams · Journal of the London Mathematical Society · 1964 · 462 citations

, , +5

Single-element extensions of matroids

Henry Crapo · Journal of Research of the National Bureau of Standards Section B Mathematics and Mathematical Physics · 1965 · 129 citations · Full text

, , +4