Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Source. Theorem 12 and its proof, printed pp. 1328–1329 (published PDF).
Statement. Let and be indexed families of subsets of finite . Let be integers with
There is a subset that is both a -transversal of and a -transversal of if and only if
for all .
Proof. Suppose first that (1) holds. Taking gives
so Theorem 7 gives an -transversal. Similarly, taking gives and hence a -transversal. In particular, the replicated transversal matroid has rank and its bases are the -transversals.
By the rank formula, condition (1) says exactly that
Applying Theorem 4 to , multiplicity vector , and the matroid gives a -transversal independent in that matroid. It has
so it is a base and hence also an -transversal.
Conversely, suppose is both kinds of transversal. It is a base of and a -transversal independent in that matroid. The necessary direction of Theorem 4 gives
Applying the rank formula to every gives (1) for every .
If , then , both families are empty, and proves the equivalence.
The proof establishes individual feasibility before referring to -transversals as bases. It also supplies the cardinality bars and binds the set omitted in the printed intermediate prose.