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