Problem 601

Erdős Problem #601: declared status 'open'. Formalized: no. For which limit ordinals $\alpha$ is it true that if $G$ is a graph with vertex set $\alpha$ then $G$ must have either an infinite path or independent set on a set of vertices with order type $\alpha$? Prize: $500. Tags: graph theory, set theory.