Berge–Jackson–Zhang conjecture on circuit double covers
Statement
Let be a cubic graph. A circuit double cover (CDC) is a set of circuits such that every edge of is covered by exactly two circuits. A graph is cyclically -edge-connected if no edge cut of size less than separates two circuits.
Berge–Jackson–Zhang conjecture. If is a cyclically -edge-connected cubic graph and is a set of pairwise disjoint circuits of , then is a subset of a CDC, unless is the Petersen graph.
The paper states that its construction yields counterexamples to this conjecture: the relevant permutation -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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.