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