Erdős problem 592
Determine which countable ordinals have the property that, if , then in any red/blue colouring of the edges of there is either a red or a blue .
How the state got here
0 of 6 recorded- Prior stateNone retained
- WorkNo submitted work retained
- VerificationNo check retained
- DecisionNo Repository has decided
- StandingNothing recorded 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:f3e54653d06294d60ce13c2cf4c3fb2b3aef448201994880070f009924ef674b
- Metadata
- sha256:d9e15ffc171d249bfcbca4be4d8648aed8e5be79a5b92e72f15f42cfc32c6bd0
- Observation
- sha256:9c8326e865b6017b103af7611c852a06776d81964979b8ab5a1b800cd550dff6
- Content
- sha256:e5412a49ba1bb0fb41a7a45d4a121d26717fdf5fa9570bac6fd4289482d5ff76
- Repository
- sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
- Projection
- sha256:a4a96441668a9f8b33afbcb3f696a2639f5fae145f36ddc063d7f67d5fb87ce8
- Source commit
- 36c6d0fef71a3fec84d9dcd5eeca4e22e378f7cb