Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Claim. Erdős and Rado prove, for every infinite cardinal , that : every coloring of the pairs of a set of size with colors has a homogeneous set of size . The site's remark quotes the stronger ordinal form ; the cardinal form suffices here.
The step to the first relation of Problem 1172 is one line (author-recorded). Under GCH, , so the theorem at gives , and in particular every -coloring of has a homogeneous set of size . A set of ordinals of size has order type at least , so it contains subsets of types and . Whichever color the homogeneous set has, the relation holds.
Covers. The first relation, under GCH, as the site prints it. The problem page's Formulation records that the booklet's version of this relation is cut off, so the printed target may not be the one Erdős and Hajnal intended. The second and third relations and the consistency question are not covered.
Depends on. No page of this wiki.
Source. P. Erdős and R. Rado, A partition calculus in set theory, Bull. Amer. Math. Soc. 62 (1956), no. 5, 427-489, doi:10.1090/S0002-9904-1956-10036-0 (source card). The issue is dated September 1956 and the record carries no day, so this page's date is the first of that month.
Acceptance. Refereed: the theorem is in a journal paper in the Bulletin of the American Mathematical Society.