Degree-diameter problem $N(5,4)$
The largest possible number of vertices in a graph of maximum degree $5$ and diameter $4$.
Lower bound:
$212$
Upper bound:
Unknown
Updates
-
Lower bound: $212$
Geoffrey Exoo, 1998 through 2010
[via Table of the largest known graphs of a given diameter and maximal degree - Wikipedia]