Erdős Problem #917
Statement
Let and be the largest number of edges in a graph on vertices which has chromatic number and is critical (i.e. deleting any edge reduces the chromatic number). Is it true that Is it true that More generally, is it true that, for ,
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.