Goddyn's conjecture on cycle double covers
Goddyn's conjecture on cycle double covers
Let be a bridgeless graph, and let be a cycle in . A cycle double cover is a list of cycles in in which each edge appears exactly twice.
Goddyn's conjecture. There exists a cycle double cover of containing .
The paper says its proof resolves this stronger conjecture for 3-regular graphs, while the conjecture remains unresolved for graphs that are not 3-regular. Thus the general statement remains open.
Sources & referencesView supporting material
Primary source
Mary Radcliffe, “A proof of the Cycle Double Cover Conjecture”, arXiv:1510.02075 (2015).
Progress summary
Never refreshed
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.