The Shortest Cycle Cover Conjecture
Statement
For a bridgeless graph , let denote the length of a shortest cycle cover of . Shortest Cycle Cover Conjecture. If is a bridgeless graph, then
This conjecture gives a sharp proposed upper bound for shortest cycle covers and is related in the paper to the parameter . It 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.