ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a cubic graph. A circuit double cover (CDC) is a set of circuits such that every edge of GG is covered by exactly two circuits. A graph is cyclically 55-edge-connected if no edge cut of size less than 55 separates two circuits.

Berge–Jackson–Zhang conjecture. If GG is a cyclically 55-edge-connected cubic graph and DD is a set of pairwise disjoint circuits of GG, then DD is a subset of a CDC, unless GG is the Petersen graph.

The paper states that its construction yields counterexamples to this conjecture: the relevant permutation 22-factor is not contained in any circuit double cover. Earlier finite counterexamples were also found by computer search.

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.