ProbXiv
Explorersign in
Problem archiveProblem record

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 c<4c<4, consider critical graphs with girth at least five and average degree at most cc.

Modified Araújo–Cohen–Giroire–Havet conjecture. For every c<4c<4, the number of pairwise non-isomorphic critical graphs with girth at least five and average degree at most cc is finite.

The source describes this as a weakening of the Araújo–Cohen–Giroire–Havet conjecture and states that the case c=3c=3 is settled; no resolution is supplied for all c<4c<4.

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.