Degree-diameter problem $N(15,8)$
The largest possible number of vertices in a graph of maximum degree $15$ and diameter $8$.
Lower bound:
$90001236$
(90,001,236)
Upper bound:
Unknown