Cage order $n(5,4)$

Complete bipartite graph with 5 vertices on each side

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

Value: $10$ Verified lower bound Verified upper bound

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