Degree-diameter problem $N(13,10)$
The largest possible number of vertices in a graph of maximum degree $13$ and diameter at most $10$.
Lower bound:
$3789512750$
(3,789,512,750)
Upper bound:
Unknown
Verified bounds
Verified bounds come with a certificate that is checked automatically: a formal proof in Lean, or an explicit construction checked by a program. Submit a certificate.
- Lower bound: None yet
- Upper bound: None yet
Updates from the literature
-
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] -
2026-10
Lower bound: $3789512750$
(3,789,512,750)
Dharunish Yugeswardeenoo in October 2026
[via Comellas, F. The (Degree, Diameter) Problem for Graphs (records table), last changed November 2, 2026]