Degree-diameter problem $N(20,4)$
The largest possible number of vertices in a graph of maximum degree $20$ and diameter $4$.
Lower bound:
$34952$
(34,952)
Upper bound:
Unknown