Erdős problem 750
Let be some function such that as . Does there exist a graph of infinite chromatic number such that every subgraph on vertices contains an independent set of size at least ?
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:7ef93b03ee14446f32b45de88b386e48499f6e3ee21ed2ebc817cd33c3f3be49
- Metadata
- sha256:9d76204e4266cf278eb1ae06008bdd7056e74c45031490e2df6f27fa84342446
- Observation
- sha256:9c8326e865b6017b103af7611c852a06776d81964979b8ab5a1b800cd550dff6
- Content
- sha256:b178fea70a722a6aeace403154c5903fffb96c174fd29445b77de25d8e2a5525
- Repository
- sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
- Projection
- sha256:a4a96441668a9f8b33afbcb3f696a2639f5fae145f36ddc063d7f67d5fb87ce8
- Source commit
- 36c6d0fef71a3fec84d9dcd5eeca4e22e378f7cb