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), the paragraph following Theorem 1, printed p. 82 (published scan).

Let D⊆AD\subseteq A be a prescribed set of qq distinct elements. The finite indexed family S\mathcal S has an SDR whose range contains DD if and only if, for every X⊆[n]X\subseteq[n],

∣X∣≤∣IS(X)∣,∣X∣+∣D∖⋃j∈XSj∣≤n.|X|\le |I_{\mathcal S}(X)|, \qquad |X|+|D\setminus\bigcup_{j\in X}S_j|\le n.

Proof. Set αi=1\alpha_i=1 for ai∈Da_i\in D and αi=0\alpha_i=0 otherwise, and set every βi=1\beta_i=1. An SRR for these bounds is exactly an SDR containing DD. Here a=qa=q, α(IS(X))=∣D∩⋃j∈XSj∣\alpha(I_{\mathcal S}(X))=|D\cap\bigcup_{j\in X}S_j| and β(IS(X))=∣IS(X)∣\beta(I_{\mathcal S}(X))=|I_{\mathcal S}(X)|. Substitution in Theorem 1 gives precisely the displayed inequalities, in both directions. For X=∅X=\varnothing, the second inequality includes q≤nq\le n; mandatory elements lying outside every family member also fail the appropriate test. □\square

Attribution and scope. The source identifies this specialization with the Hoffman–Kuhn condition and cites their 1956 paper. The proof here is the local substitution into Ford–Fulkerson's theorem; it does not reproduce the separate Hoffman–Kuhn proof or the broader partition-quota result mentioned in the introduction.

Bears on. Mandatory-element variants of finite transversal constructions. No Erdős problem: the paper states no relation to a numbered Erdős problem.