Problem Statement
Let $\mathfrak{c}$ be the ordinal of the real numbers, $\beta$ be any countable ordinal, and $2\leq n<\omega$. Is it true that $\mathfrak{c}\to (\beta, n)_2^3$?
Categories:
Graph Theory Ramsey Theory Set Theory
Progress
Erdős and Rado proved that $\mathfrak{c}\to (\omega+n,4)_2^3$ for any $2\leq n<\omega$.Source: erdosproblems.com/70 | Last verified: January 13, 2026