Degree-diameter problem $N(19,7)$
The largest possible number of vertices in a graph of maximum degree $19$ and diameter $7$.
Lower bound:
$39123116$
(39,123,116)
Upper bound:
Unknown