Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Source. Theorem 3, printed p. 1324 (published PDF).
Printed statement. For a fixed vector of nonnegative integers, the source asserts without qualification that the -transversals of form the bases of a matroid on (p. 1324). As a matroid has at least one base, this fails when has no -transversal.
Corrected statement. Let be a finite indexed family and let be integers. The replicated family defines a transversal matroid on in every case. If has a -transversal, then this matroid has rank
and its bases are exactly the -transversals of . If no -transversal exists, the matroid still exists but has rank less than ; its bases cannot be the empty family asserted by the unqualified printed statement.
Proof. Use the replicated index set
By the finite transversal-matroid theorem, the ranges of partial transversals of are the independent sets of a matroid on .
A full transversal of assigns distinct elements to the copies of index . Grouping those elements by gives pairwise disjoint sets with . Its range is therefore a -transversal. Conversely, label the elements of each part by the copied indices. This turns any -transversal into a full transversal of .
Suppose one full transversal exists. It has elements, and no partial transversal can have more than elements. Hence has rank . Every full transversal is an independent -set and hence a base. Conversely, every base has elements and is a partial-transversal range; its witnessing injection uses all replicated indices, so it is full and its range is a -transversal.
If no full transversal exists, the same transversal matroid has rank below . It has at least one base because its ground set is finite, whereas the family of -transversals is empty. For example, , , and give exactly this obstruction. When , the replicated family is empty and its unique full transversal and base are both .
The existence qualification is explicit in source corrections.