Wiki
Wiki

Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.

Updated

Edmonds: partitioning a matroid into independent sets


Read the full Markdown source.

Jack Edmonds, "Minimum partition of a matroid into independent subsets," Journal of Research of the National Bureau of Standards, Section B 69B (1965), 67--72.

Edmonds proves the matroid partition criterion: the ground set of a matroid, which the paper's definition makes finite, can be partitioned into kk independent sets exactly when every subset AA has rank at least ∣A∣/k|A|/k (equivalently ∣A∣≤kr(A)|A|\le k r(A)). This is the exact matroid analogue of the implication asked about in E0774.