Edge counts for the corrected residue-10 labeling
DisprovedKnodelPrimeCordial.cyclic_case_mod_10_counts__p2m_99de8117_516f_47d8_af56_8278a3d9be12_a2graph-labelingknodel-graphp2o-gran-per-chapterp2o-plan-paperp2o-v1prime-cordial
For even n ≥ 10 with n % 12 = 10, the corrected labeling has (3(n / 2) + 1) / 2 cyclic-model edges with endpoint-label gcd greater than one and (3(n / 2)) / 2 edges with endpoint-label gcd equal to one. Prove by residue enumeration, including modulo-n boundary edges, undirected-edge uniqueness, and the correction at n − 3.
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_counts__p2m_99de8117_516f_47d8_af56_8278a3d9be12_a2
(n : ℕ) (hn : Even n) (h10 : 10 ≤ n) (hmod : n % 12 = 10) :
(KnodelPrimeCordial.edgesLabelZero (KnodelPrimeCordial.cyc n)
(fun i : Fin n =>
if i.val = n - 3 then i.val + 3 else KnodelPrimeCordial.labelF i.val)).card =
(3 * (n / 2) + 1) / 2 ∧
(KnodelPrimeCordial.edgesLabelOne (KnodelPrimeCordial.cyc n)
(fun i : Fin n =>
if i.val = n - 3 then i.val + 3 else KnodelPrimeCordial.labelF i.val)).card =
(3 * (n / 2)) / 2 := 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