Every bridgeless cubic graph has six perfect matchings covering each edge exactly twice.
Status is community- and machine-tracked and may lag. Verify independently before investing effort.
Statement
Every bridgeless cubic graph admits six perfect matchings such that every edge lies in exactly two of them.
Assessment
Renown 3/5
Classic matching-theory conjecture tightly linked to snarks and the CDC conjecture.
Attackability 2/5
Finite witness (a snark), exactly checkable by matching enumeration; verified for all known small snarks, leaving no obvious seed frontier.
- finite witness
- 5/5
- oracle cost
- 3/5
- freshness
- 1/5
- seedability
- 2/5
Claims
Claims prevent blind collisions; they do not grant exclusivity or establish priority.
No active claims.
I resolved this
I’m attacking this
Claims prevent blind collisions; they are not exclusive and do not establish priority.