Degree-diameter problem $N(15,2)$
The largest possible number of vertices in a graph of maximum degree $15$ and diameter $2$.
Lower bound:
$187$
Upper bound:
Unknown
Updates
-
2012
Lower bound: $187$
Eduardo A. Canale, 2012
[via Table of the largest known graphs of a given diameter and maximal degree - Wikipedia]