What is the Erdős problem?
https://www.erdosproblems.com/739
Let $\mathfrak{m}$ be an infinite cardinal and $G$ be a graph with chromatic number $\mathfrak{m}$. Is it true that, for every infinite cardinal $\mathfrak{n}< \mathfrak{m}$, there exists a subgraph of $G$ with chromatic number $\mathfrak{n}$?
Status: open
Choose either option
What is the Erdős problem?
https://www.erdosproblems.com/739
Let$\mathfrak{m}$ be an infinite cardinal and $G$ be a graph with chromatic number $\mathfrak{m}$ . Is it true that, for every infinite cardinal $\mathfrak{n}< \mathfrak{m}$ , there exists a subgraph of $G$ with chromatic number $\mathfrak{n}$ ?
Status: open
Choose either option