Four-perfect-matching covers of bridgeless claw-free cubic graphs

Determine whether every bridgeless claw-free cubic graph can be covered by four perfect matchings.

Background

The paper states that the five-cycle double cover conjecture holds if and only if every bridgeless claw-free cubic graph can be covered by four perfect matchings. Thus, determining whether four perfect matchings suffice for every bridgeless claw-free cubic graph is an equivalent formulation of the unresolved five-cycle double cover conjecture.

The paper proves instead that five perfect matchings always suffice for bridgeless claw-free cubic graphs and studies how many edges four perfect matchings can always cover. Its second main theorem guarantees that four perfect matchings cover at least 299/315 of the edges, but does not resolve whether they cover every edge.

References

It remains open whether every bridgeless claw-free cubic graph can be covered by four perfect matchings.

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