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 .
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:8c823d621b7e1256c8e47c60a5f1c54c016a5507e6f27b2bab537f6f5f232067
- Content
- sha256:94412182c360cf93d8a51329f1d6b7b0c07d5a47f4f87181fb94a4441c1f4ec6
- Repository
- sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
- Projection
- sha256:c9d14c459c518937e758918b5897dc3b22f1a55f07739afe99502f5b046c907a
- Source commit
- 2415f78e850aeee50afdca525c6f2e0ea606f207