Erdős problem 598
Erdős Problem 598: Let be an infinite cardinal and be the successor cardinal of . Can one colour the countable subsets of using many colours so that every with contains subsets of all possible colours?
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:9b10c25a4766bc5e0846e25d22dd90fa84d291f58c9b36f3c7d9007f3097cd11
- Metadata
- sha256:c40d67a781e3706f2d5798653dc84691a10785fa9758ed4b322aab333a9d4c3d
- Observation
- sha256:9c8326e865b6017b103af7611c852a06776d81964979b8ab5a1b800cd550dff6
- Content
- sha256:c30e7c04bde2b3ad963cdc050517bc5206b49458c7846eda7be004744c4d86b7
- Repository
- sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
- Projection
- sha256:a4a96441668a9f8b33afbcb3f696a2639f5fae145f36ddc063d7f67d5fb87ce8
- Source commit
- 36c6d0fef71a3fec84d9dcd5eeca4e22e378f7cb