Degree-diameter problem $N(4,10)$
The largest possible number of vertices in a graph of maximum degree $4$ and diameter $10$.
Lower bound:
$17703$
(17,703)
Upper bound:
Unknown