Wiki
Wiki

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 m,nm,n be positive integers. Suppose a set SS with mnmn elements has two partitions (Pi)i∈[m](P_i)_{i\in[m]} and (Qj)j∈[m](Q_j)_{j\in[m]} satisfying

∣Pi∣=∣Qj∣=n(i,j∈[m]).|P_i|=|Q_j|=n\qquad(i,j\in[m]).

There is a set R⊆SR\subseteq S of size mm containing exactly one element of every PiP_i and exactly one element of every QjQ_j. The empty-system extension m=0m=0, S=∅S=\varnothing, also holds.

Proof. For J⊆[m]J\subseteq[m], let k=∣J∣k=|J| and let

N(J)={i∈[m]:Pi∩⋃j∈JQj≠∅},r=∣N(J)∣.N(J)=\{i\in[m]:P_i\cap\bigcup_{j\in J}Q_j\ne\varnothing\}, \qquad r=|N(J)|.

The QjQ_j are disjoint and each has nn elements, so their union for j∈Jj\in J has knkn elements. Every point of that union lies in one of the PiP_i indexed by N(J)N(J). The latter classes are disjoint and each has nn elements. Hence

kn=∣⋃j∈JQj∣≤∣⋃i∈N(J)Pi∣=rn.kn=\left|\bigcup_{j\in J}Q_j\right| \le\left|\bigcup_{i\in N(J)}P_i\right|=rn.

Since nn is a positive integer, this implies r≥kr\ge k. It includes k=0k=0. Thus every indexed subfamily satisfies the class-neighbor condition of Theorem 3, which supplies the required common representative set. For m=0m=0 the empty set is the required set directly. □\square

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.