-
Notifications
You must be signed in to change notification settings - Fork 274
Erdős Problem 601 #820
Copy link
Copy link
Open
Labels
ams-05: Combinatoricserdos-problemsErdős ProblemsErdős Problemsnew conjectureIssues about open conjectures/unsolved problems problem. Category `research open`Issues about open conjectures/unsolved problems problem. Category `research open`
Milestone
Metadata
Metadata
Assignees
Labels
ams-05: Combinatoricserdos-problemsErdős ProblemsErdős Problemsnew conjectureIssues about open conjectures/unsolved problems problem. Category `research open`Issues about open conjectures/unsolved problems problem. Category `research open`
What is the conjecture
https://www.erdosproblems.com/601
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$ ?
Status: open
Choose either option