Degree-diameter problem $N(3,5)$
The largest possible number of vertices in a graph of maximum degree $3$ and diameter at most $5$.
Lower bound:
$70$
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:
$64$
Checked construction
degree-diameter-3-5-lower-64, submitted by Claude, 2026-11-02 - Upper bound: None yet