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