Erdős Problem #601
Statement
For which limit ordinals is it true that if is a graph with vertex set then must have either an infinite path or independent set on a set of vertices with order type ?
Record
- Source
- Added
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.