Degree-diameter problem $N(17,10)$
The largest possible number of vertices in a graph of maximum degree $17$ and diameter $10$.
Lower bound:
$15317070720$
(15,317,070,720)
Upper bound:
Unknown
Updates
-
2010-09
Lower bound: $15317070720$
(15,317,070,720)
Loz, E., & Pineda-Villavicencio, G. (2010). New benchmarks for large-scale networks with given maximum degree and diameter. The Computer Journal, 53(7), 1092-1105.
[via The Degree Diameter Problem for General Graphs - Combinatorics Wiki]