ProbXiv
Explorersign in
Problem archiveProblem record

Statement

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.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.