Degree-diameter problem $N(17,2)$
The largest possible number of vertices in a graph of maximum degree $17$ and diameter $2$.
Lower bound:
$274$
Upper bound:
Unknown
Updates
-
1966
Lower bound: $274$
Brown, W. G. (1966).
[via The Degree Diameter Problem for General Graphs - Combinatorics Wiki]