Erdős Problem #1168 — A Countable-Color Partition Relation
Prove, without assuming the generalized continuum hypothesis, that
Equivalently, prove that there is a coloring of the pairs of a set of cardinality with countably many colors such that there is no monochromatic subset of cardinality in the distinguished first color, and, for each subsequent color, there is no monochromatic subset of cardinality in that color.
Progress summary
Never refreshed
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.