Degree-diameter problem $N(13,8)$
The largest possible number of vertices in a graph of maximum degree $13$ and diameter $8$.
Lower bound:
$29927790$
(29,927,790)
Upper bound:
Unknown