Cage order $n(13,6)$

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

Lower bound: $314$ Verified
Upper bound: $336$

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