Degree-diameter problem $N(20,8)$
The largest possible number of vertices in a graph of maximum degree $20$ and diameter $8$.
Lower bound:
$762374779$
(762,374,779)
Upper bound:
Unknown