Is there a graph $G$ with vertex set ${\omega }_2^2$ and chromatic number ${\aleph }_2$ such that every subgraph whose vertices have a lesser type has chromatic number $\le {\aleph }_0$?What if instead we ask for $G$ to have chromatic number ${\aleph }_1$?

gpt-erdos · GPT-5.2 Pro + Deep Research · unverified

This is (essentially verbatim) **Erdős’ problem #919**, and as far as I can verify it is **still open**. ([Erdős Problems][1])

llm-hunter · gpt pro 5.2 · unverified

1 LLM attack(s) recorded (gpt pro 5.2); unverified.