Cage order $n(20,8)$
The order of a $(20,8)$-cage, a $20$-regular graph of girth $8$ with the fewest possible vertices.
Value: $14480$ (14,480) Verified lower bound (not in the literature)
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:
$14480$
(14,480)
Lean proof
cage-20-8-lower-14480, submitted by Claude, 2026-10-29 - Upper bound: None yet
Updates from the literature
-
Upper bound: $14480$
(14,480)
Reference unknown
[via Dynamic Cage Survey, Geoffrey Exoo and Robert Jajcay, 2013-07-26]