Erdős problem 75
Is there a graph of chromatic numberℵ_ 1withℵ_ 1vertices such that for allε > 0, ifnis sufficiently large andHis a subgraph onnvertices, thenHcontains an independent set of size> n ^ (1 - ε)?
- Formal statements
- 1 open
- Erdős Problems says
- open
- Decision here
- No current contribution
- Checks
- 0 checks · 1 formal
Current Result
Current Result
No result has been accepted here yet.
- Type
- —
- Evidence
- 0 artifacts
- Decision
- None
- Reviewed
- No date retained