Degree-diameter problem $N(19,9)$
The largest possible number of vertices in a graph of maximum degree $19$ and diameter $9$.
Lower bound:
$8855580344$
(8,855,580,344)
Upper bound:
Unknown