(11,5)
37,632
205,366 edges · maximum degree 11 · diameter exactly 5
Local sequence: 37,631 → 37,632 (+1)
Comellas rechecked 2026-11-18: 37,631 → 37,632 (+1)
Degree–diameter · reported 2026-11-16 · rechecked 2026-11-18
Reported on 16 November 2026, our graphs reach 37,632 vertices at (11,5) and 42,433 at (12,5), exceeding the Comellas table by 1 and 81 vertices. Both gains still hold in the 18 November recheck.
| Degree, diameter | Our construction | Dated table improvement |
|---|---|---|
| (10,4) | 2,567 | +1 over 2,566 · 2026-11-05 |
| (11,5) | 37,632 | +1 over 37,631 · 2026-11-16; rechecked 2026-11-18 |
| (12,5) | 42,433 | +81 over 42,352 · 2026-11-16; rechecked 2026-11-18 |
| (16,4) | 16,416 | +32 over 16,384 · 2026-11-05 |
Each result is tied to the public record checked when it was reported. Later advances extend the timeline while preserving the earlier achievement.
(10,4) construction and verification ↗ · Four-setting case overview ↗
Run: 2026-11-11 v4-maintenance workflow + local DD updates → informs v5 main maintenance.
37,632
205,366 edges · maximum degree 11 · diameter exactly 5
Local sequence: 37,631 → 37,632 (+1)
Comellas rechecked 2026-11-18: 37,631 → 37,632 (+1)
42,433
246,309 edges · maximum degree 12 · diameter exactly 5
Local sequence: 42,402 → 42,433 (+31)
Comellas rechecked 2026-11-18: 42,352 → 42,433 (+81)
Our own (12,5) sequence advances from 42,402 to 42,433 (+31), whereas the Comellas entry checked on 2026-11-16 was 42,352 (+81).
D12: preserve the source, add legal attachments. The 42,402-vertex source stays as an exact induced subgraph. Thirty-one insertions each use 12 permitted attachment points, adding 372 edges in total. The source supplies old–old distances; new-point checks cover the remaining pairs.
D11: connect the geometric core and its boundary. Because the core changes, core–core distances use the H9 geometric theorem under its stated σ/π identification, while the 160 peripheral vertices and the newly added vertex are checked directly against the whole final graph.
Starting from an inclusion-minimal core-blocking set, attachments are completed jointly across all remaining degree ports. Actual bad vertex pairs guide edits to earlier choices, and each stage builds only on independently verified prefixes.
Both final edge lists regenerate deterministically and pass independent degree and adjacency checks. D12 retains all source edges and runs complete breadth-first search from all 31 new vertices; D11 combines the H9 theorem (under the stated σ/π identification) for core–core pairs with complete breadth-first search from all 161 peripheral and new vertices. End-to-end Lean proofs and independent refereeing for these D5 graphs remain open.
Constructed on the 2026-11-11 v4-maintenance workflow with local degree–diameter updates; those methods later informed v5 main maintenance, while the published v5 tag stays an earlier snapshot.
Update state before dispatching new work. Fold returned results into the active task state before launching the next search or review, avoiding duplicate runs and stale-state rollbacks.
DD evolution and implementation record ↗ · Base: current facts ↗ · DD: joint completion ↗ · DD: verified prefixes ↗
On 18 November 2026, the Comellas table lists 2,614 for (10,4) and 16,848 for (16,4). Our 2,567- and 16,416-vertex constructions remain documented as improvements over the entries checked on 5 November 2026.
Comellas table ↗ · Historical (10,4) construction ↗
Case overview and methods ↗ · Source package and replay ↗ · v5 maintenance notes ↗