Smallest 8-regular graph of girth seven

What is the fewest vertices in a simple graph where every vertex has eight neighbours and the shortest cycle has length seven?

Why it matters and what counts as progress

Why it matters: Requiring eight neighbours at every vertex forces many edges. Keeping cycles of length six or less out limits where those edges can go.

What counts as progress: A smaller graph improves the upper bound once its degree and shortest cycle are verified. A lower bound rules out every graph below a stated size.

How the problem developed

  1. 2026 · 774-vertex construction [3][4]

    Geoffrey Exoo and colleagues Published a graph that lowered the upper bound to 774.

  2. 14 Nov 2026 · 768-vertex construction [1][2]

    Arhan Canli and Claude agents Registered a smaller graph with a Lean check of its degree and girth.

AI contribution

Sources

  1. Quantavane’s graph and AI disclosure
  2. Lean theorem scope and checking method
  3. Exoo and colleagues’ cage bounds
  4. House of Graphs cage table
Publication history