Degree-diameter problem $N(15,10)$
The largest possible number of vertices in a graph of maximum degree $15$ and diameter $10$.
Lower bound:
$10012349898$
(10,012,349,898)
Upper bound:
Unknown
Updates
-
2008
Lower bound: $10012349898$
(10,012,349,898)
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]