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 ?
- Formal statements
- 3 solved
- Erdős Problems says
- proved (Lean)
- Decision here
- No current contribution
- Checks
- 0 checks · 3 formal
Current Result
Current Result
No result has been accepted here yet.
- Type
- —
- Evidence
- 0 artifacts
- Decision
- None
- Reviewed
- No date retained