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