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