The Shortest Cycle Cover Conjecture

For a bridgeless graph $G$, let $scc(G)$ denote the length of a shortest cycle cover of $G$. Shortest Cycle Cover Conjecture. If $G$ is a bridgeless graph, then

$$scc(G)\leq \frac{7}{5}|E(G)|.$$

This conjecture gives a sharp proposed upper bound for shortest cycle covers and is related in the paper to the parameter $T(G)$. It remains open.