Nonexistence conjecture for cubic 8-circulant nut graphs
A cubic -circulant nut graph is a cubic nut graph admitting an -circulant structure. Nonexistence conjecture for cubic -circulant nut graphs. There exists no cubic -circulant nut graph. This is the only unresolved case in the cubic -circulant nut graph existence problem; computational results suggest that such graphs might not exist, but no proof is given here.
References
2 papers in this index state this conjecture (2018–2024). The statement above is taken from the most recent of them; the others are arXiv:1808.08747.
Source: Nino Bašić and Ivan Damnjanović, “On cubic polycirculant nut graphs”, arXiv:2411.16904 (2024).
Progress summary
A submitted proof claims to settle the last unresolved case, but no independent assessment has verified it, so the conjecture remains open.
The conjecture says that no cubic -circulant nut graph exists. Bašić and Damnjanović established that this is the sole unresolved value in the cubic -circulant existence classification.
Known results
- No examples exist for , while infinitely many exist for and (Bašić and Damnjanović, 2025).
- The case was left as a conjectured nonexistence result, supported only by computational evidence (Bašić and Damnjanović, 2025).
November 7, 2026 community proof claim
A submitted proof argues that no cubic -circulant nut graph exists, using a finite classification of signed quotient matrices and exact certificate checks. This is an unverified community submission, not independent mathematical confirmation.
Current status (as of November 2026): The cases are settled, while the nonexistence conjecture remains unverified despite a submitted proof claim.
Sources
Solutions 1
There is no cubic 8-circulant nut graph: completing the existence classification of cubic polycirculant nut graphsSee full solution
Result and scope. Bašić and Damnjanović, On cubic polycirculant nut graphs, arXiv:2411.16904v1 Conjecture 16 = Conjecture 1 of the published version (Comput. Appl. Math. 2025). Their Theorem 2 excludes l in {1,2,4,5} and constructs cubic l-circulant nut graphs for l in {3,6,7} and l >= 9; l = 8 was the only open case. Proof: a single kernel character on semiregular orbit coordinates gives a symmetric signed integral 8x8 quotient with nullity exactly one (injective lift) and nonzero diagonal cofactors; cubicity forces a local grammar; an inductive kernel-checked catalogue of 194 connected subcubic supports with 1,722 isomorphism certificates, 669 augmentations and tree switching reduce to 9,172 signed matrices, each excluded by an exact determinant (8,208) or zero principal cofactor (964) certificate. Valid for all orbit sizes m, without bounding graph order.
Complete proof: There is no cubic 8-circulant nut graph: completing the existence classification of cubic polycirculant nut graphs · PDF.
The paper page contains the supplementary proof-source JSON and extract_sources.py. The linked paper supplies the complete argument and states the precise scope of the Lean certificate, ordinary proofs, supporting computations, and source interpretation. Those qualifications are retained here; a supporting computation is not a proof of a broader statement.
This is an AI-assisted research preprint. Internal review is not external journal peer review. Bounded prior-art searches do not establish worldwide priority. See the paper for formalization and trust limits.