Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Source. Theorem 9 and the preceding rank sentence, printed p. 1327 (published PDF).
Printed statement. Welsh states that has a -transversal containing if and only if
This statement is false. Condition (1) is instead the Hall criterion for a -transversal contained in . The prose immediately before the theorem uses the matroid with the single base , of rank , which does express the “contains ” problem. Thus neither changing only the prose nor changing only the displayed inequality gives an unambiguous transcription repair.
Counterexamples. First, (1) is not necessary for a -transversal containing . Take
The unique -transversal contains , but at the printed inequality reads .
Nor is the printed inequality sufficient for the printed conclusion. Take
Condition (1) holds for both subsets of , but every -transversal has one element and therefore cannot contain the two-element set .
The valid contained-in criterion is proved in the corrected contained theorem. The valid contains- criterion needs ordinary -Hall conditions and an additional defect inequality, and is proved in the corrected contains theorem. Both are compilation-supplied results, not claims about a published erratum.