Permanent problem IDPPL 066
Graph theory
For which limit ordinals α is it true that if G is a graph with vertex set α then G must have either an infinite path or independent set on a set of vertices with order type α?
For which limit ordinals α is it true that if G is a graph with vertex set α then G must have either an infinite path or independent set on a set of vertices with order type α?
A solution must appear in a reputable journal, with documentation that Erdős offered the displayed amount. Claims are administered by the Combinatorics Foundation; erdosproblems.com does not pay awards.