Degree-diameter problem $N(14,8)$
The largest possible number of vertices in a graph of maximum degree $14$ and diameter $8$.
Lower bound:
$55913932$
(55,913,932)
Upper bound:
Unknown