Cycle Double Cover Conjecture
TheoremDB P3062 · graph theory
Inferred from the community field; finer classification has not been reviewed.
Problem statement
Prove that every finite bridgeless loopless undirected multigraph admits a cycle double cover: a finite multiset of cycles in which every labelled edge occurs exactly times, counting multiplicity.
Lean 4
Formal statement
Lean 4theorem CDCLean.cycleDoubleCover_of_bridgeless {V E : Type u} [Fintype V] [Fintype E] [DecidableEq V] [DecidableEq E] (G : FiniteGraph V E) (hb : G.Bridgeless) : Nonempty G.CycleDoubleCoverOn-site verification needs an executable Lean target. None is attached yet.
A source attachment or link is not a verified proof. The statement’s correspondence with the original question needs human review.
Proofs & verification
No Lean has been submitted for this problem yet. A Lean file can be attached to a submission for review, though with no target here it cannot be machine-checked.
Progress & source assessment
Source-reported assessment, retrieved 8 September 2026. Frontier Science has not independently reviewed this status.
Resolved. Lean-verified
Recorded progress
Add yours →Nothing recorded yet. A pointer to a paper the entry is missing counts.
Machine attempts
0 recordedAttempts run against the statement below and are recorded in full, including the failures. The point is to stop the next model — and the next person — from re-walking a road that is already known to end. Each attempt costs 25 credits.
No machine attempts recorded.
Sign in to run an attempt. New accounts start with enough credits for ten.
Discussion
0 notesNotes are for clarifying the statement, flagging a missing reference, or recording why an approach fails. Claimed solutions belong in a submission, where they can be reviewed.
No notes yet.
Sign in to add a note.