The residue-six labeling covers the label interval
ProvedKnodelPrimeCordial.labelF_mod_6_surjOn__p2m_48a5a004_52cb_4c8e_8f15_c1802c1a70b4_a3graph-labelingknodel-graphp2o-gran-per-chapterp2o-plan-paperp2o-v1prime-cordial
Every label in the stated interval has a preimage among the stated indices. Invert the twelve-residue offset table in each complete block; for the final six labels, use residues 3, 0, 4, 1, 2, 5 for offsets 1 through 6, respectively.
Preamble
import Mathlib import Definitions.Def_KnodelPrimeCordial_labelF
Formal statement
theorem KnodelPrimeCordial.labelF_mod_6_surjOn__p2m_48a5a004_52cb_4c8e_8f15_c1802c1a70b4_a3 (n : ℕ) (hn : Even n) (h10 : 10 ≤ n) (hmod : n % 12 = 6) :
Set.SurjOn KnodelPrimeCordial.labelF (Set.Icc 0 (n - 1)) (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