Cage order $n(4,5)$

Robertson graph
Koko90, via Wikimedia Commons. CC BY-SA 3.0.

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

Value: $19$

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