Erdős Problem #1068 — Does every graph with chromatic number ℵ_1 contain a countable subgraph which is infinitely vertex-connected?
Statement
Does every graph with chromatic number contain a countable subgraph which is infinitely vertex-connected?
Record
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.