Five-cycle double cover conjecture

Establish that every bridgeless graph has five even subgraphs such that every edge belongs to exactly two of them.

Background

A cycle double cover is a family of even subgraphs in which every edge belongs to exactly two members. The paper identifies the five-cycle double cover conjecture as a stronger unresolved form of the cycle double cover conjecture. The conjecture is also stated formally in the subsequent Conjecture environment: every bridgeless graph should admit five even subgraphs with each edge appearing in exactly two of them.

The paper notes that an 8-cycle double cover has been obtained for every bridgeless graph, but that the five-member version remains unresolved. It further cites an equivalence between this conjecture and the existence of four-perfect-matching covers for all bridgeless claw-free cubic graphs.

References

The proof yields an 8-cycle double cover, while the stronger 5-cycle double cover conjecture remains open.

— Perfect matching covers of claw-free cubic graphs  (2610.01137 - Zhou et al., 1 Oct 2026) in Section 1, paragraph following Theorem 1.2