Archdeacon's 5-oriented-cycle-double-cover conjecture
Statement
An oriented -cycle double-cover (or -OCDC) of a graph is a multiset of oriented cycles in which every edge occurs in each orientation in exactly one cycle.
Archdeacon's conjecture. Every bridgeless graph has a -OCDC.
The conjecture is part of the cycle-double-cover approach to nowhere-zero flow problems. The supplied text states that it is not known whether every bridgeless graph has a -OCDC for some , so this specific assertion remains open.
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.