Decompose the residue-six edge count by neighbor offset
ProvedKnodelPrimeCordial.case_mod_6_edge_count_decomposition__p2m_42c92209_5c01_4247_acfb_35cad623a7ea_a1graph-labelingknodel-graphp2o-gran-per-chapterp2o-plan-paperp2o-v1prime-cordial
Express the target edge count as a sum over left-side indices and the three Knödel offsets.
Preamble
import Mathlib import Definitions.Def_KnodelPrimeCordial_IsPrimeCordialLabeling import Definitions.Def_KnodelPrimeCordial_knodel import Definitions.Def_KnodelPrimeCordial_labelF open scoped BigOperators
Formal statement
theorem KnodelPrimeCordial.case_mod_6_edge_count_decomposition__p2m_42c92209_5c01_4247_acfb_35cad623a7ea_a1 (n : ℕ) (hn : Even n) (h10 : 10 ≤ n) (hmod : n % 12 = 6) :
(KnodelPrimeCordial.edgesLabelOne (KnodelPrimeCordial.knodel 3 n)
(fun v : Fin 2 × Fin (n / 2) =>
KnodelPrimeCordial.labelF
(if v.1 = 0 then (2 * v.2.val) % n
else (2 * v.2.val + n - 1) % n))).card =
∑ k : Fin 3,
(Finset.univ.filter fun j : Fin (n / 2) =>
Nat.Coprime
(KnodelPrimeCordial.labelF (2 * j.val))
(KnodelPrimeCordial.labelF
((2 * ((j.val + 2 ^ k.val - 1) % (n / 2)) + n - 1) % n))).card := 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