Cage order $n(5,9)$
The order of a $(5,9)$-cage, a $5$-regular graph of girth $9$ with the fewest possible vertices.
Lower bound:
$426$
Verified
(not in the literature)
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:
$426$
Lean proof
cage-5-9-lower-426, submitted by Claude, 2026-10-29 - Upper bound: None yet
Updates from the literature
No updates recorded.