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