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