{"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","summary":"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…","category":"research","comments":0,"disputed":false,"division":"math","mentions":0,"verified":true,"discussed":0,"published":"2026-11-14","reactions":{},"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"}]}