Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Claim. Problem 1219 asks whether , with two colors, for an increasing sequence of integers such that is strictly increasing and . Shelah's Corollary 1.3 (p. 1260) states: if then
and the Remark after it records that this answers Problem 3 of the 1971 Erdős--Hajnal list. The two sums are the same cardinal: a countable sum of infinite cardinals is its supremum, is nondecreasing and , so $\sum_{n<\omega}2^{\aleph_n}=\sup_k2^{\aleph_{n_k}} =\sum_k2^{\aleph_{n_k}}$, and the relation is the catalog's. The corollary is the case , of Theorem 1.2 (p. 1260): if , , and is not eventually constant but eventually at least , then , indeed ; here is Ramsey's theorem. The proof takes half a page from the paper's Canonization Lemma 1.1 (pp. 1258--1260), which reduces a two-coloring of pairs on a union of blocks of size to a coloring of pairs of indices, to which Ramsey's theorem is applied. Section 0 (p. 1257) describes Problem 3 as the only open case, for infinite cardinals, of , so the corollary completes that discussion; this answers the problem in the affirmative.
Misprint in Theorem 1.2. The printed hypothesis says the powers are eventually at least , a misprint for : the proof chooses with , and as printed the theorem would assert whenever for all , which fails for every singular cardinal. Corollary 1.3 carries the catalog's hypothesis explicitly, so the claim does not depend on this reading. Hajnal's stronger conjecture (Conjecture 1A, p. 1261) is a separate question, recorded as still unproven by Komjáth (2025), and is not part of this claim.
Source. Saharon Shelah, Notes on partition calculus, in Infinite and finite sets (Colloq., Keszthely, 1973; dedicated to P. Erdős on his 60th birthday), Vol. III, Colloq. Math. Soc. János Bolyai 10, North-Holland, Amsterdam, 1975, pp. 1257--1276; MR 0406798; zbMATH 0325.04005; Shelah archive Sh:40, whose copy of the printed article is the second link above. The source card carries result pages for Corollary 1.3 and Theorem 1.2. An author-recorded reconstruction of the proofs, with the identification of the two sums written out, is filed in the research folder for this problem; it is not an independent review. The volume carries only the year, so this page is dated the first of January 1975.
Acceptance. Reviewed: the curator of erdosproblems.com, T. F. Bloom,
marks the problem PROVED and his remark credits the proof to Shelah [Sh75]
(problem page last edited 1 September 2026; as of 2026-10-07 no comments
and no proof claims); Komjáth's survey (Bull. Symbolic Logic 31, 2025, p. 419)
records the paper as the proof of Problem 3 and the last remaining case of
the discussion of , a named expert's documented
acceptance; the community database marks the problem proved, in an entry
last updated 2026-09-12. The curator and Komjáth are independent of the
author. The paper appeared in
a colloquium proceedings volume, Colloq. Math. Soc. János Bolyai 10, reviewed
by Mathematical Reviews and zbMATH, not in a journal, so refereed is not
listed. Nothing on this page is independently reviewed by this project.
Depends on.