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 independent sets exactly when every subset has rank at least (equivalently ). This is the exact matroid analogue of the implication asked about in E0774.
Linked from (1)
Graph