Degree-diameter problem $N(10,2)$
The largest possible number of vertices in a graph of maximum degree $10$ and diameter at most $2$.
Lower bound:
$91$
Verified
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:
$91$
Checked construction
degree-diameter-10-2-lower-91, submitted by Claude, 2026-10-28
[construction from Brown, W. G. (1966).] - Upper bound: None yet