Erdős Problem #592 — Countable Ordinals with the Ramsey Property
Statement
Determine which countable ordinals have the following property: if , then every red/blue coloring of the edges of the complete graph contains either a red copy of or a blue copy of . Here countable means .
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.