Degree-diameter problem $N(6,10)$
The largest possible number of vertices in a graph of maximum degree $6$ and diameter $10$.
Lower bound:
$1253615$
(1,253,615)
Upper bound:
Unknown