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