Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Source. Example 3 and Theorem 11, printed pp. 1327–1328 (published PDF).
Statement. Let be a finite partition of , and let be integers. There is a -transversal of satisfying
if and only if, for every ,
where .
Proof. Let consist of the subsets satisfying
This is a matroid. It is hereditary and contains the empty set. If and , then for some block one has . Choose . Since , the set remains in . Thus the augmentation axiom holds.
For any , a largest independent subset takes elements from each block. Hence
A -transversal satisfies (1) exactly when it is independent in . Applying Theorem 4 and substituting into (3) gives precisely (2).
The direct independence definition works even when . The source's exact-capacity base description does not cover that endpoint, and its displayed theorem omits the cardinality bars inside the positive part; both points are recorded in source corrections.