Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Source. Hall (1935), introductory result on printed p. 26 and its deduction from Theorem 3 on p. 30 (canonical PDF). Hall credits this result to D. König and gives earlier references.
Statement. Let be positive integers. Suppose a set with elements has two partitions and satisfying
There is a set of size containing exactly one element of every and exactly one element of every . The empty-system extension , , also holds.
Proof. For , let and let
The are disjoint and each has elements, so their union for has elements. Every point of that union lies in one of the indexed by . The latter classes are disjoint and each has elements. Hence
Since is a positive integer, this implies . It includes . Thus every indexed subfamily satisfies the class-neighbor condition of Theorem 3, which supplies the required common representative set. For the empty set is the required set directly.
Scope. The common block size is positive and finite; the proof cancels a positive finite integer. Equal infinite cardinalities alone do not justify that step. The general two-partition criterion remains available separately in Theorem 3, without a finite class-size assumption.
This is the equal-block common-representative result that Hall credits to König (1916). It is not being identified with the general equality between maximum matching size and minimum vertex-cover size in an arbitrary finite bipartite graph. The latter remains a separate input in the Edmonds–Fulkerson compilation. The earlier proofs cited by Hall are not reproduced here; this page expands Hall's own immediate counting deduction from Theorem 3.
Bears on. No problem. The Problem 126 argument cites only Theorem 1, not this corollary.