Wiki
Wiki

Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.

Updated


Source. Ford–Fulkerson (1958), Corollary and equation (13), printed p. 83 (published scan).

Two indexed families S,T\mathcal S,\mathcal T of nn subsets of a finite ground set have a common SDR if and only if

∣X∣+∣Y∣≤n+∣IS(X)∩IT(Y)∣(X,Y⊆[n]).|X|+|Y|\le n+|I_{\mathcal S}(X)\cap I_{\mathcal T}(Y)| \qquad(X,Y\subseteq[n]).

A common SDR means two injective representative assignments with the same range, permitting different assignments of that range to the two families' indices.

Proof. In Theorem 2, take αi=0\alpha_i=0 and βi=1\beta_i=1 for every element. An SRR is then injective. Equal multiplicities mean exactly equal ranges, and the theorem's weighted intersection sum becomes the cardinality in the displayed criterion. Its equivalence proves both directions, including the empty-family case. □\square

Bears on. Common finite transversals. This is more than the separate Hall conditions for each family: the intersection term couples their possible choices of a shared range. No Erdős problem: the paper states no relation to a numbered Erdős problem.

Prescribed-multiplicity comparison. Welsh (1969), Theorem 12 allows nonnegative multiplicities pi,qip_i,q_i with the same total NN. Setting pi=qi=1p_i=q_i=1 makes N=nN=n and turns its criterion into

∣IS(X)∩IT(Y)∣≥∣X∣+∣Y∣−n,|I_{\mathcal S}(X)\cap I_{\mathcal T}(Y)|\ge |X|+|Y|-n,

after identifying ground elements with their indices. Rearranging gives the Ford–Fulkerson common-SDR inequality displayed above. This is an exact specialization of the Welsh statement, not a second proof of this 1958 corollary.