The corrected residue-10 labeling stays in range
ProvedKnodelPrimeCordial.cyclic_case_mod_10_label_range__p2m_6dfc39c6_04b4_4470_a7a0_9be6cdfdbf5c_a1graph-labelingknodel-graphp2o-gran-per-chapterp2o-plan-paperp2o-v1prime-cordial
Every index receives a label between 1 and n, inclusive.
Preamble
import Mathlib import Definitions.Def_KnodelPrimeCordial_IsPrimeCordialLabeling import Definitions.Def_KnodelPrimeCordial_cyc import Definitions.Def_KnodelPrimeCordial_labelF
Formal statement
theorem KnodelPrimeCordial.cyclic_case_mod_10_label_range__p2m_6dfc39c6_04b4_4470_a7a0_9be6cdfdbf5c_a1
(n : ℕ) (hn : Even n) (h10 : 10 ≤ n) (hmod : n % 12 = 10) :
∀ i : Fin n,
(fun i : Fin n => if i.val = n - 3 then i.val + 3 else KnodelPrimeCordial.labelF i.val) i ∈
Set.Icc 1 n := by sorrySource
Haque, Khanam, Shahriar, Prime cordial labeling of Knödel graph, manuscript (2026) (held version, sha256 366502170d8d7c65ccc2fcc6f5373dac872d6efdc838ba9e671eb578e4c08c60), Lemma 2.3, p.3 (PDF p.3); proof pp.4–6