We construct smallest known trivalent graphs for girths 16 and 18. One construction uses voltage graphs, and the other coset enumeration techniques for group presentations. AMS Su...
Constructing some regular graph with a given girth, a given degree and the fewest possible vertices is a hard problem. This problem is called the cage graph problem and has some l...