Regular Graphs of Given Degree and Girth

The Cage Problem is one of the oldest problems in Graph Theory. The idea is to find smallest regular graphs with given degree and girth and with the minimum possible number of vertices. A regular graph is one in which every vertex has the same degree. The degree of a vertex is the number of edges incident with it, and the girth of a graph is the length of a shortest cycle.
The links below point to files containing the smallest known graphs for certain values of degree and girth. Each graph is saved as an adjacency list. The vertices are labeled with the integers 0 to n-1. Line 1 lists the neighbors of vertex 0, line 2 the neighbors of vertex 1, etc. Only my constructions are shown here, for more complete coverage see the Dynamic Survey.

Adjacency Lists for the Graphs

f(3,14) <= 384 f(3,16) <= 960 f(3,17) <= 2176 f(3,18) <= 2560
f(3,20) <= 5376 f(3,23) <= 49326 f(3,25) <= 108906 f(4,7) <= 67
f(4,9) <= 270 f(4,10) <= 384 f(5,10) <= 1296
f(7,7) <= 640 f(7,8) <= 672 f(10,5)<=124 f(11,5) <= 154
f(12,5) <= 203 f(13,5) <= 230
A page on the (3,14)-graph
A page on the (3,16)-graph
A page on the (3,17)-graph
A page on the (3,18)-graph

Lifts of Theta Graphs

Recently, Robert Jajcay and I undertook an investigation of lifts of theta graphs, focusing on the use of SL(2,q) as the voltage group. The following record graphs were produced.

Adjacency Lists for the Graphs

f(3,30) <= 1143408
f(3,29) <= 1141484
f(7,8) <= 672

Geoff Exoo