Degree-diameter problem $N(13,9)$
The largest possible number of vertices in a graph of maximum degree $13$ and diameter $9$.
Lower bound:
$249155760$
(249,155,760)
Upper bound:
Unknown