Degree-diameter problem $N(19,8)$
The largest possible number of vertices in a graph of maximum degree $19$ and diameter $8$.
Lower bound:
$501001000$
(501,001,000)
Upper bound:
Unknown