Erdős Problem #919
Statement
Is there a graph with vertex set and chromatic number such that every subgraph whose vertices have a lesser type has chromatic number ? What if instead we ask for to have chromatic number ?
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.