Modified Araújo–Cohen–Giroire–Havet critical-graph finiteness conjecture
Statement
Let a critical graph be a graph minimal with respect to having no good edge-labeling, let its girth be the length of its shortest cycle, and let its average degree be the average of its vertex degrees. For every real number , consider critical graphs with girth at least five and average degree at most .
Modified Araújo–Cohen–Giroire–Havet conjecture. For every , the number of pairwise non-isomorphic critical graphs with girth at least five and average degree at most is finite.
The source describes this as a weakening of the Araújo–Cohen–Giroire–Havet conjecture and states that the case is settled; no resolution is supplied for all .
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.