Erdős Problem #944
Statement
A critical vertex, edge, or set of edges, is one whose deletion lowers the chromatic number. Let and . Must there exist a graph with chromatic number such that every vertex is critical, yet every critical set of edges has size ?
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.