Erdős–Lovász double-critical graph conjecture
Statement
Let be a connected graph with chromatic number . It is double-critical if for every edge , the graph is -colorable. The complete graphs are double-critical. Erdős–Lovász double-critical graph conjecture. If is a double-critical, -chromatic graph, then
Complete graphs are the only known examples of double-critical graphs. The conjecture has been verified for and remains open for .
Record
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.