Latest D5 endpoints: 37,632 / 42,433 ↗
Degree–diameter · (10,4)
2,567 vertices.
Ten neighbors. Four hops.
A 10-regular graph of exact diameter 4 raises our constructive lower bound to 2,567 vertices, one above the 2,566 entry on the Comellas table when checked on 2026-11-05.
Constructed with MathRSI v2 and the Degree–Diameter plugin; the local-edit and exact-replay methods from that run were built into the v4 plugin.
Construction
How the last vertex fits
The 2,566-vertex predecessor is already 10-regular. Delete five disjoint edges, then join a new vertex to all ten endpoints so every vertex keeps degree 10.
Degree bookkeeping is only the first step: distances between old vertices and from the new vertex must all stay within four. The final extension needs no extra switch, while the two preceding extensions use 2-switches among existing vertices.
(193,2362) · (192,2363) · (417,2555)
(2508,2565) · (2511,2528)
Dated table comparisons
More vertices at the same degree and diameter
| Degree, diameter | Previous | New | Gain |
|---|---|---|---|
| (10,4) New | 2,566 | 2,567 | +1 |
| (11,5) | 37,628 | 37,631 | +3 |
| (12,5) | 42,342 | 42,402 | +60 |
| (16,4) | 16,384 | 16,416 | +32 |
Constructive lower bounds compared against the Comellas table at the time of each run ((10,4) checked 2026-11-05; the other three accessed 2026-11-03; see the 2026-11-16 update for newer table values and D5 constructions).
Historical catalogue snapshot: 163 constructed graphs across 44 parameter pairs, including intermediate orders, together with 49 completed concrete-graph Lean proofs.
Research → workflow
How it reached MathRSI
- Original researchThree dated table improvements and 153 constructed graphs, developed with standalone ARIS tools.
- v2 · DD pluginResearch methods and checkers distilled into the Degree–Diameter plugin.
- v2 + DD runConstructs the 2,567-vertex graph at (10,4).
- v4 · plugin methodsExact edit recipes, local degree-capacity moves and whole-graph distance checks built into the DD plugin.
Evidence
Replay the construction. Inspect the checks.
The portable chain starts from the published 2,557-vertex graph and reconstructs all ten orders from 2,558 to 2,567.
- Independent all-roots BFS: runs breadth-first search from all 2,567 vertices directly on the edge list, confirming exact diameter 4 with distance-four witness (0,2).
- Lean final assembly: preserved
Final2567andFinal2567Auditbuild logs verify theFin 2567target using only the three standard Lean axioms. - Exact edit replay: reconstructs all ten unordered edge sets and confirms they match the accepted graphs.
The portable package ships those verification logs rather than the full Lean project needed to rebuild the formal proof from scratch, and external review of that formalization is still unfinished. Within the 49 concrete-graph Lean proofs in the catalogue, this sequence adds 2,558 and 2,567.