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