Cyclic edge-connectivity conjecture for cages

A $(k,g)$-cage is a smallest $k$-regular graph of girth $g$. A cycle-separating edge-cut is an edge-cut whose removal yields at least two components containing a cycle. A graph is cyclically $r$-edge-connected if it has no cycle-separating edge-cut of fewer than $r$ edges.

Cyclic edge-connectivity conjecture. Every $(k,g)$-cage is cyclically $(k-2)g$-edge-connected.

The value $(k-2)g$ is a natural upper bound, obtained by separating a $g$-cycle from the rest of the cage. The source presents this as an open conjecture and proposes it as the maximal possible cyclic edge-connectivity of cages.