On $(k,g)$-Graphs without $(g+1)$-Cycles

Leonard Chidiebere Eze, Robert Jajcay, Jorik Jooken

A $(k,g,\underline{g+1})$-graph is a $k$-regular graph of girth $g$ which does not contain cycles of length $g+1$. Such graphs are known to exist for all parameter pairs $k \geq 3,…