Erdős Problem #1032
Statement
We say that a graph is -chromatic critical if it has chromatic number , and removing any edge decreases the chromatic number to . Is there, for arbitrarily large , a -chromatic critical graph on vertices with minimum degree ?
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.