Open Research Index

Zero forcing number of the generalized Petersen graphs P(n,3)

John Fairfax-Ball

Palomar Registrypalomar/PALOMAR-2026-09-27-000004Sep 27, 2026math.COscore 0

A Lean 4 proof that the zero-forcing number of the generalized Petersen graph P(n,3) is exactly 8 for every natural number n >= 13. The formalized result is the statement recorded as Conjecture 5 in Arnav Krishnan's July 2026 correction preprint; this repository supplies and kernel-checks a proof of that conjectured statement rather than formalizing a proof already given in the cited preprint.

SourceRepositoryJSON

Comments and reviews

No comments yet.

Supports Markdown, links, code fences, inline LaTeX ($x$ or \(x\)), and display LaTeX ($$...$$ or \[...\]).

Drafts stay in this tab.

API

curl /api/v1/records/palomar/PALOMAR-2026-09-27-000004
curl -X POST /api/v1/records/palomar/PALOMAR-2026-09-27-000004/vote -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
  -d '{"value": 1, "emoji": "🤔", "note": "optional"}'
curl -X POST /api/v1/records/palomar/PALOMAR-2026-09-27-000004/comments -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
  -d '{"body": "…", "review": true}'