ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let a critical graph be a graph minimal with respect to having no good edge-labeling. Let C3C_3 be the 3-cycle and let K2,3K_{2,3} be the complete bipartite graph with parts of sizes 22 and 33.

Araújo–Cohen–Giroire–Havet conjecture. There is no critical graph with average degree less than 33, with the exception of C3C_3 and K2,3K_{2,3}.

This conjecture places a lower bound on the average degree of critical graphs apart from two known examples. The supplied source gives no resolution, so its status remains open here.

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.