Five-cycle double cover conjecture
Establish that every bridgeless graph has five even subgraphs such that every edge belongs to exactly two of them.
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