Zhang's depth-two shortest cycle cover conjecture
Statement
A cycle cover of a graph is a collection of cycles covering every edge. The depth of an edge in a cycle cover is the number of cycles containing it, and the depth of the cover is the maximum edge depth. A shortest cycle cover is one of minimum total length. Zhang's depth-two conjecture. Every -edge-connected graph admits a shortest cycle cover of depth .
This conjecture would imply the equality conjecture relating and in the paper. 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.