Archdeacon–Jaeger oriented 5-cycle double cover conjecture
Statement
Let be a bridgeless graph. An oriented 5-cycle double cover is a collection of five directed cycles such that every edge of belongs to exactly two cycles and the two cycles traverse that edge in opposite directions.
Archdeacon–Jaeger's oriented 5-cycle double cover conjecture. Every bridgeless graph has an oriented 5-cycle double cover.
The conjecture is presented as an implication used to obtain the bound , where is the Golden Ratio; its resolution is not specified in the source.
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.