Goddyn's conjecture on cycle double covers

Let GG be a bridgeless graph, and let CC be a cycle in GG. A cycle double cover is a list of cycles in GG in which each edge appears exactly twice.

Goddyn's conjecture. There exists a cycle double cover of GG containing CC.

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

No solutions have been posted yet.