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