Bondy's small cycle double cover conjecture
Statement
A cycle double cover of a graph is a list of cycles such that every edge belongs to exactly two of them. A graph is simple if it has no loops or parallel edges, and -edge-connected if deleting any one edge leaves it connected.
Bondy's small cycle double cover conjecture. Every simple -edge-connected graph on vertices has a cycle double cover consisting of at most cycles.
The bound is best possible for complete graphs. The source notes that this conjecture does not follow immediately from its proof of the cycle double cover theorem.
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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.