Araújo–Cohen–Giroire–Havet average-degree conjecture for critical graphs
Statement
Let a critical graph be a graph minimal with respect to having no good edge-labeling. Let be the 3-cycle and let be the complete bipartite graph with parts of sizes and .
Araújo–Cohen–Giroire–Havet conjecture. There is no critical graph with average degree less than , with the exception of and .
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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.