Formally verified AI-led

An 8-regular graph of girth 7 on 768 vertices, below the previous record of 774

Claude agents working for Quantavane under Arhan Canli constructed an 8-regular graph of girth 7 on 768 vertices, verified in Lean by kernel computation and registered on Palomar, improving the best known upper bound on the order of an (8,7)-cage from the 774 listed in the House of Graphs table.

Model
Claude (Anthropic) agents; version not stated
Field
Mathematics
Date
2026-11-14
Human collaborators
Arhan Canli

What was found

A (k, g)-cage is a k-regular graph of girth g with as few vertices as possible. For (8, 7) the Moore bound gives at least 457 vertices, and published constructions gave 777 (Abreu, Araujo-Pardo, Balbuena, Labbate and Salas, 2015), 784 (Kiss, 2025) and 774 (Exoo, Goedgebeur, Jooken, Stubbe and Van den Eede, 2026). The new graph is the case q = 7 of a construction that starts from the incidence graph of the generalized quadrangle W(7), with 800 vertices, modifies Kiss's construction by deleting the lines of two rows, and repairs the vertices left one neighbour short with a matching, giving 800 - 16 - 16 = 768. Lean's kernel checks, by decide +kernel and without native_decide, that the adjacency lists define a simple 8-regular graph and that for every vertex the non-backtracking walks of length at most 3 through any two neighbours end in disjoint sets, which rules out cycles of length up to 6, and an explicit 7-cycle fixes the girth at exactly 7.

Novelty check

The repository reports a search of the literature and of the House of Graphs cage table on 12 November 2026 that found no 8-regular graph of girth 7 with fewer than 774 vertices, and calls novelty its reading of a limited search. arXiv, 2026-11-16, abs:cage AND abs:girth AND abs:"regular graph" AND abs:7 returned 6 records, none improving the (8, 7) cell. The House of Graphs table was not re-read for this entry. Nothing in this registry covered cages.

Caveats and known objections

Graded formal because the object itself is checked: degree and girth are verified by the kernel from the adjacency lists, independent of the programs that generated them, and Palomar records trust level high. What is not established is that 768 is the best known bound, which rests on the repository's own search of the cage table; that is a fact about the literature, not about the graph. The general construction for every odd prime power q at least 7 is neither formalized nor reviewed, and the README states that no mathematician outside Quantavane has reviewed the proof. Autonomy is ai-led: the README says the construction, the checks, every program and every line of Lean were produced by Claude agents under Canli's direction.

Machine-checked elsewhere

PalomarAn 8-regular graph of girth 7 on 768 vertices

PALOMAR-2026-11-14-000013 · arhancanli/quantavane-cage-8-7 at 593719d9713e · checked 2026-11-16

ProvedCage87.exists_regular_girth_seven

A Lean proof that typechecks against the recorded statement at a pinned commit under a declared axiom set, checked mechanically rather than by human review. It does not certify that a result is new or of research interest: the only filter on that is a language-model screen, and Palomar states that it adds no human editorial step.

Trust level high. The statement uses only Mathlib's SimpleGraph, IsRegularOfDegree and girth, so there are no project definitions to audit.

No independent check is recorded on this entry yet.

Reading the primary source closely enough to say whether it supports the claim counts as a check, and you are credited on the entry.

Or on GitHub: submit a check challenge the grade send a correction or send a pull request

Entry history (1 event)
  1. AddedEntered the registry graded Formally verified and AI-led.

Entries are never deleted. A grade that does not hold up is downgraded on the record, with the reason beside it.

Graded formally verified for verification and ai-led for autonomy. What these mean.

Cite this entry

Plain text
whataifound.org. (2026). An 8-regular graph of girth 7 on 768 vertices, below the previous record of 774. whataifound.org: A Registry of AI Scientific and Mathematical Discoveries. https://whataifound.org/finding/2026-11-14-cage-8-7-768-vertices
BibTeX
@misc{whataifound-quantavane-2026-vertices,
  title        = {An 8-regular graph of girth 7 on 768 vertices, below the previous record of 774},
  author       = {{whataifound.org}},
  year         = {2026},
  howpublished = {whataifound.org: A Registry of AI Scientific and Mathematical Discoveries},
  note         = {Result by Quantavane. Verification: Formally verified. Autonomy: AI-led.},
  url          = {https://whataifound.org/finding/2026-11-14-cage-8-7-768-vertices}
}

Related findings

← All mathematics findings in the registry