Erdős Problem #1092
Statement
Let be maximal such that, if a graph has the property that every subgraph on vertices is the union of a graph with chromatic number and a graph with edges, then has chromatic number . Is it true that ? More generally, is ?
Record
- Source
- Added
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.