Alon–Tarsi–Jaeger short cycle cover conjecture
Statement
Let be a bridgeless graph with edges. A cycle cover of is a multiset of cycles from such that every edge of belongs to at least one cycle, and its length is the sum of the lengths of its cycles.
Short cycle cover conjecture. Every bridgeless graph with edges has a cycle cover of length at most .
This conjecture was independently proposed by Alon and Tarsi and by Jaeger. The paper proves weaker bounds for bridgeless cubic graphs, so the stated bound remains unresolved here.
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.