Erdős problem 75
Is there a graph of chromatic number ℵ_ 1 with ℵ_ 1 vertices such that for all ε > 0, if n is sufficiently large and H is a subgraph on n vertices, then H contains an independent set of size > n ^ (1 - ε)?
Workspace
public preview
- #75
- None
- 0
Reported activity
Work these sources record against this Problem. Source-reported attribution, not reviewed here.
AI standalone
- Machine
AI building on literature
- Machine