Status
On this page
Status
Topics
Status
On this page
Status
Topics
Under what set theoretic assumptions is it true that can be -coloured such that, for every uncountable , contains a pair of each colour?
Source: erdosproblems.com/474
An accepted solution exists. The statement can be neither proved nor disproved from the standard axioms of set theory.
Independent of ZFC, relative to the consistency of ZFC with an Erdős or measurable cardinal: Erdős, Hajnal and Rado 1965 settles the not-disprovable side, since their coloring exists under the continuum hypothesis, which Gödel showed consistent with ZFC, and Shelah 1988 settles the not-provable side. The site labels the problem NOT PROVABLE, on Shelah's result, and records as open whether the coloring can fail when [Va99], a narrower question than the Statement. It credits the coloring under the continuum hypothesis to Erdős but does not record that this classical result settles the other side, so this page departs from the site's label. The pending claim Shelah 2026 reads a 2026 preprint as removing the large cardinal.