Erdős Problem #1067 — Chromatic Subgraphs with Infinite Connectivity
Statement
No. The following assertion is false: every simple graph whose chromatic cardinal is contains a subgraph whose chromatic cardinal is and which is infinitely connected. Equivalently, for every type of vertices and every simple graph on , if has chromatic cardinal , then there exists a subgraph of such that has chromatic cardinal and is infinitely 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.