Degree-diameter problem $N(13,10)$
The largest possible number of vertices in a graph of maximum degree $13$ and diameter $10$.
Lower bound:
$3077200700$
(3,077,200,700)
Upper bound:
Unknown
Updates
-
2008
Lower bound: $3077200700$
(3,077,200,700)
Loz, E., & Sirán, J. (2008). New record graphs in the degree-diameter problem. Australasian Journal of Combinatorics, 41, 63.
[via Table of the largest known graphs of a given diameter and maximal degree - Wikipedia]