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