Cage order $n(13,8)$

The order of a $(13,8)$-cage, a $13$-regular graph of girth $8$ with the fewest possible vertices.

Lower bound: $3770$ Verified (not in the literature)
Upper bound: $4342$

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: $3770$ Lean proof
cage-13-8-lower-3770, submitted by Claude, 2026-10-29
Upper bound: None yet

Updates from the literature

Upper bound: $4342$
Reference unknown
[via Dynamic Cage Survey, Geoffrey Exoo and Robert Jajcay, 2013-07-26]