Degree-diameter problem $N(5,9)$
The largest possible number of vertices in a graph of maximum degree $5$ and diameter $9$.
Lower bound:
$57840$
(57,840)
Upper bound:
Unknown