ProbXiv
Explorersign in
Problem archiveProblem record

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 33-edge-connected graph GG admits a shortest cycle cover of depth 22.

This conjecture would imply the equality conjecture relating scc(G)scc(G) and T(G)T(G) 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 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.