Erdős Problem #1068 — Does every graph with chromatic number contain a countable subgraph which is infinitely vertex-connected?
Does every graph with chromatic number contain a countable subgraph which is infinitely vertex-connected?
References
Primary source
Additional references
UnsolvedMath, Erdős Problems set, ULAM AI, licensed CC BY 4.0.
Progress summary
Never refreshed
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.