New small regular graphs of given girth: the cage problem and beyond

Geoffrey Exoo, Jan Goedgebeur, Jorik Jooken +2

The cage problem concerns finding $(k,g)$-graphs, which are $k$-regular graphs with girth $g$, of the smallest possible number of vertices. The central goal is to determine $n(k,g)…