Erdős problem 590
Let be the infinite ordinal . It was proved by Chang [Ch72] that any red/blue colouring of the edges of there is either a red or a blue .
How the state got here
1 of 6 recorded- Prior stateNone retained
- WorkNo submitted work retained
- VerificationNo check retained
- DecisionNo Repository has decided
- StandingA Result stands here
- Next gapNot recorded
Result history
No result history yet
No proposed change is retained for this Problem, so there is nothing to show a decision on.
Correction history
No correction history
Technical details
Exact provenance
- Problem row
- sha256:e761e8976fff367092c297dd8c01d5d7491a192756008686922cb6124ae75a24
- Metadata
- sha256:15d495357eb8efbf9556e78d69e1367c9170368705422799833e8b199e0c4f80
- Observation
- sha256:9c8326e865b6017b103af7611c852a06776d81964979b8ab5a1b800cd550dff6
- Content
- sha256:94412182c360cf93d8a51329f1d6b7b0c07d5a47f4f87181fb94a4441c1f4ec6
- Repository
- sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
- Projection
- sha256:a4a96441668a9f8b33afbcb3f696a2639f5fae145f36ddc063d7f67d5fb87ce8
- Source commit
- 36c6d0fef71a3fec84d9dcd5eeca4e22e378f7cb