Preprint
Jul 2026
Exponentially Many Circuit Double Covers
The cycle double cover conjecture of Szekeres and Seymour, the proof of which was recently announced by OpenAI, states that every bridgeless graph has a collection of cycles covering every edge exactly twice. We study the counting version of this statement for cubic graphs, where we count circuit double covers --- coll...
Radek Husek, Robert Sámal
· 0 citations