Kissing numbers of regular graphs

Maxime Fortier Bourque, Bram Petri

We prove a sharp upper bound on the number of shortest cycles contained inside any connected graph in terms of its number of vertices, girth, and maximal degree. Equality holds onl…