The proof of a conjecture about cages

Xiang-Feng Pan, Jing-Zhong Mao, Hui-Qing Liu

The girth of a graph is defined as the length of a shortest cycle in the graph. A $(k;g)$-cage is a graph of minimum order among all $k$-regular graphs with girth $g$. A cycle $C$…