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 be a prescribed set of distinct elements. The finite indexed family has an SDR whose range contains if and only if, for every ,
Proof. Set for and otherwise, and set every . An SRR for these bounds is exactly an SDR containing . Here , and . Substitution in Theorem 1 gives precisely the displayed inequalities, in both directions. For , the second inequality includes ; mandatory elements lying outside every family member also fail the appropriate test.
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.