Degree-diameter problem $N(11,10)$
The largest possible number of vertices in a graph of maximum degree $11$ and diameter $10$.
Lower bound:
$600380000$
(600,380,000)
Upper bound:
Unknown