Degree-diameter problem $N(13,3)$
The largest possible number of vertices in a graph of maximum degree $13$ and diameter $3$.
Lower bound:
$856$
Upper bound:
Unknown
Updates
-
2008-06-03
Lower bound: $851$
Gómez, J. (2009), Some new large (Δ, 3)-graphs. Networks, 53: 1-5. -
2021
Lower bound: $856$
Vlad Pelakhaty, 2021
[via Table of the largest known graphs of a given diameter and maximal degree - Wikipedia]