Degree-diameter problem $N(12,8)$
The largest possible number of vertices in a graph of maximum degree $12$ and diameter $8$.
Lower bound:
$15924326$
(15,924,326)
Upper bound:
Unknown