Erdős Problem #1175 — Triangle-Free Subgraphs of Prescribed Chromatic Number
Statement
Let be an uncountable cardinal, i.e. . Must there exist a cardinal such that every graph with chromatic cardinal contains a subgraph that is triangle-free and has chromatic cardinal exactly ? Equivalently, is the following true: for every cardinal with , there exists a cardinal such that, for every vertex type and every graph on with chromatic cardinal , there is a subgraph of such that contains no triangle and its chromatic cardinal is ?
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.