Degree-diameter problem $N(14,9)$
The largest possible number of vertices in a graph of maximum degree $14$ and diameter $9$.
Lower bound:
$600123780$
(600,123,780)
Upper bound:
Unknown