Wiki
Wiki

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 A=(A1,…,An)\mathcal A=(A_1,\ldots,A_n) and B=(B1,…,Bn)\mathcal B=(B_1,\ldots,B_n) be indexed families of subsets of finite SS. Let pi,qi≥0p_i,q_i\ge0 be integers with

∑i=1npi=∑i=1nqi=N.\sum_{i=1}^n p_i=\sum_{i=1}^n q_i=N.

There is a subset X⊆SX\subseteq S that is both a pp-transversal of A\mathcal A and a qq-transversal of B\mathcal B if and only if

∣A(J)∩B(K)∣≥p(J)+q(K)−N(1)|A(J)\cap B(K)| \ge p(J)+q(K)-N \tag{1}

for all J,K⊆[n]J,K\subseteq[n].

Proof. Suppose first that (1) holds. Taking K=[n]K=[n] gives

∣A(J)∣≥∣A(J)∩B([n])∣≥p(J),|A(J)|\ge |A(J)\cap B([n])|\ge p(J),

so Theorem 7 gives an AA pp-transversal. Similarly, taking J=[n]J=[n] gives ∣B(K)∣≥q(K)|B(K)|\ge q(K) and hence a BB qq-transversal. In particular, the replicated transversal matroid Tp(A)T_p(\mathcal A) has rank NN and its bases are the AA pp-transversals.

By the rank formula, condition (1) says exactly that

rp(B(K))≥q(K)(K⊆[n]).r_p(B(K))\ge q(K) \qquad(K\subseteq[n]).

Applying Theorem 4 to B\mathcal B, multiplicity vector qq, and the matroid Tp(A)T_p(\mathcal A) gives a BB qq-transversal XX independent in that matroid. It has

∣X∣=∑iqi=N=rp(S),|X|=\sum_i q_i=N=r_p(S),

so it is a base and hence also an AA pp-transversal.

Conversely, suppose XX is both kinds of transversal. It is a base of Tp(A)T_p(\mathcal A) and a BB qq-transversal independent in that matroid. The necessary direction of Theorem 4 gives

rp(B(K))≥q(K)(K⊆[n]).r_p(B(K))\ge q(K) \qquad(K\subseteq[n]).

Applying the rank formula to every B(K)B(K) gives (1) for every JJ.

If n=0n=0, then N=0N=0, both families are empty, and X=∅X=\varnothing proves the equivalence. □\square

The proof establishes individual feasibility before referring to pp-transversals as bases. It also supplies the cardinality bars and binds the set XX omitted in the printed intermediate prose.