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