ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a connected graph with chromatic number tt. It is double-critical if for every edge xy∈E(G)xy\in E(G), the graph G\{x,y}G\backslash\{x,y\} is (t−2)(t-2)-colorable. The complete graphs are double-critical. Erdős–Lovász double-critical graph conjecture. If GG is a double-critical, tt-chromatic graph, then

G=Kt.G=K_t.

Complete graphs are the only known examples of double-critical graphs. The conjecture has been verified for t≤5t\le 5 and remains open for t≥6t\ge 6.

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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.