Cage order $n(9,13)$

The order of a $(9,13)$-cage, a $9$-regular graph of girth $13$ with the fewest possible vertices.

Lower bound: $337042$ (337,042) 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.

Updates from the literature

No updates recorded.