Id: palomar/PALOMAR-2026-11-14-000013 Url: https://github.com/arhancanli/quantavane-cage-8-7/tree/593719d9713eaf81f23e2364e973824ac208bbc4 Json: https://data.palomar-registry.org/entries/PALOMAR-2026-11-14-000013-v1.json Repo: https://github.com/arhancanli/quantavane-cage-8-7 Tags: math.CO, msc:05C35, msc:05C38, msc:51E12 Score: 0 Title: An 8-regular graph of girth 7 on 768 vertices Trust: high Domain: math.CO Source: palomar Authors: Arhan Canli Reviews: 0 Subject: math.CO Category: research Comments: 0 Disputed: false Division: math Mentions: 0 Verified: true Discussed: 0 Published: 2026-11-14 Formalized: true Formalizes: title=An 8-regular graph of girth 7 on 768 vertices, the case q = 7 of a girth-7 construction from the generalized quadrangle W(q) (Quantavane, November 2026) identifier=https://quantavane.com/results/ relationship=formalizes Page: https://delphi.science/r/palomar/PALOMAR-2026-11-14-000013 A Lean 4 and Mathlib proof that there is an 8-regular simple graph of girth 7 on 768 vertices (Mathlib's SimpleGraph, IsRegularOfDegree and girth), so that the order n(8, 7) of an (8, 7)-cage is at most 768; the House of Graphs cage table listed 774 when this was written. The graph is data (adjacency lists in a binary trie). Lean's kernel checks (decide +kernel, no native_decide) that it is simple and 8-regular, and, for every vertex v and every two neighbours x ≠ y, that the ends of the non-backtracking walks of length at most 3 starting with the edge v x are disjoint from those starting…