What was already known
Exoo, Goedgebeur, Jooken, Stubbe and Van den Eede gave the previous 774-vertex upper bound listed by House of Graphs.
AI involvement
Canli directed the project and credits Claude agents with the construction, the supporting programs and the Lean proofs.
- Quantavane’s graph and AI disclosureAuthorship and AI contribution disclosure
Importance
The explicit graph lowers the upper bound by six vertices.
Technical verification
The project reports that Lean’s kernel checked the degree and simplicity of the graph, the absence of cycles of length at most six and a specified seven-cycle.
Formal checking
The project reports that Lean’s kernel checked the degree and simplicity of the graph, the absence of cycles of length at most six and a specified seven-cycle.
- Checker
- Lean kernel, as reported by Quantavane
- Scope
- Checked the supplied adjacency data, a non-backtracking-walk certificate excluding shorter cycles, and an explicit cycle of length seven.
- Basis
- Reported by the linked checker
- Lean theorem scope and checking methodReported checking and theorem scope
Human understanding
The repository describes the graph modifications and the cycle check. It does not identify a separate human explanation of the construction.
Correction and publication history
Curated the reported result and its documented AI contribution.
Read this published revision