Wiki
Wiki

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

Updated


Source. Example 3 and Theorem 11, printed pp. 1327–1328 (published PDF).

Statement. Let (Ed)d∈D(E_d)_{d\in D} be a finite partition of SS, and let ad≥0a_d\ge0 be integers. There is a pp-transversal XX of A=(Ai)i∈I\mathcal A=(A_i)_{i\in I} satisfying

∣X∩Ed∣≤ad(d∈D)(1)|X\cap E_d|\le a_d \qquad(d\in D) \tag{1}

if and only if, for every J⊆IJ\subseteq I,

∣A(J)∣−∑d∈D(∣A(J)∩Ed∣−ad)+≥p(J),(2)|A(J)| -\sum_{d\in D}\bigl(|A(J)\cap E_d|-a_d\bigr)^+ \ge p(J), \tag{2}

where x+=max⁡{x,0}x^+=\max\{x,0\}.

Proof. Let M\mathcal M consist of the subsets Y⊆SY\subseteq S satisfying

∣Y∩Ed∣≤ad(d∈D).|Y\cap E_d|\le a_d \qquad(d\in D).

This is a matroid. It is hereditary and contains the empty set. If Y,Z∈MY,Z\in\mathcal M and ∣Y∣<∣Z∣|Y|<|Z|, then for some block EdE_d one has ∣Y∩Ed∣<∣Z∩Ed∣|Y\cap E_d|<|Z\cap E_d|. Choose z∈(Z∩Ed)∖Yz\in(Z\cap E_d)\setminus Y. Since ∣Y∩Ed∣<∣Z∩Ed∣≤ad|Y\cap E_d|<|Z\cap E_d|\le a_d, the set Y∪{z}Y\cup\{z\} remains in M\mathcal M. Thus the augmentation axiom holds.

For any W⊆SW\subseteq S, a largest independent subset takes min⁡{∣W∩Ed∣,ad}\min\{|W\cap E_d|,a_d\} elements from each block. Hence

rM(W)=∑d∈Dmin⁡{∣W∩Ed∣,ad}=∣W∣−∑d∈D(∣W∩Ed∣−ad)+.(3)\begin{aligned} r_{\mathcal M}(W) &=\sum_{d\in D}\min\{|W\cap E_d|,a_d\}\\ &=|W|-\sum_{d\in D}\bigl(|W\cap E_d|-a_d\bigr)^+. \end{aligned} \tag{3}

A pp-transversal satisfies (1) exactly when it is independent in M\mathcal M. Applying Theorem 4 and substituting W=A(J)W=A(J) into (3) gives precisely (2). □\square

The direct independence definition works even when ad>∣Ed∣a_d>|E_d|. The source's exact-capacity base description does not cover that endpoint, and its displayed theorem omits the cardinality bars inside the positive part; both points are recorded in source corrections.