GP(n,2) non-Hamiltonian exactly at 5 and 11 below 13
Theorem.GP(n,2) non-Hamiltonian exactly at 5 and 11 below 13 — the one constructor classifies n = 3..12 by exhaustive search: only Petersen and GP(11,2) fail.
Proof.the one constructor classifies n = 3..12 by exhaustive search: only Petersen and GP(11,2) fail — Alspach n ≡ 5 (mod 6) cited for all n.
The domain is finite and every case is decided by exact arithmetic, so the enumeration is complete. ∎
src/thunder/verify/index.ts#discoveredTheoremsWaveTen
1 · Classification
finite-complete — computed witness within a cited frame (the unbounded form leans on the cited literature)
2 · Provenance
Documented theorem re-derived by exhaustive computation (humanityNovel=false); first-in-this-registry is the only sense of discovered.
Acknowledgment
"GP(n,2) non-Hamiltonian exactly at 5 and 11 below 13" is a re-derivation, acknowledged to documented mathematics — the original proof is the prior art this re-derivation acknowledges; not new to humanity — the contribution is the reproducible computation discoveredTheoremsWaveTen.
- Prior art
- documented mathematics — the original proof is the prior art this re-derivation acknowledges
- Novelty
- not new to humanity — a re-derivation (humanityNovel = false)
- Contribution
- a reproducible computation (discoveredTheoremsWaveTen @ src/thunder/verify) that re-derives the result at zero tokens — the contribution is the verifiable recomputation, NOT the theorem
3 · Reproducibility
Recompute from source: npm run theorems:verify recomputes discoveredTheoremsWaveTen (src/thunder/verify/index.ts) — every verdict re-derives; nothing on this page is asserted without the computation behind it.