Transport prime cordial labelings from the cyclic model
ProvedKnodelPrimeCordial.cyclic_label_transport__p2m_2c82152f_23cb_4c50_aa74_3d1d5ac827a4_a2graph-labelingknodel-graphp2o-gran-per-chapterp2o-plan-paperp2o-v1prime-cordial
For even n ≥ 10, every prime cordial labeling of the cyclic model cyc n induces a prime cordial labeling of knodel 3 n.
Preamble
import Mathlib import Definitions.Def_KnodelPrimeCordial_IsPrimeCordialLabeling import Definitions.Def_KnodelPrimeCordial_cyc import Definitions.Def_KnodelPrimeCordial_knodel import Definitions.Def_KnodelPrimeCordial_vtx
Formal statement
theorem KnodelPrimeCordial.cyclic_label_transport__p2m_2c82152f_23cb_4c50_aa74_3d1d5ac827a4_a2
(n : ℕ) (hn : Even n) (h10 : 10 ≤ n)
(f : Fin n → ℕ) (hf : KnodelPrimeCordial.IsPrimeCordialLabeling
(KnodelPrimeCordial.cyc n) f) :
∃ g : Fin 2 × Fin (n / 2) → ℕ,
KnodelPrimeCordial.IsPrimeCordialLabeling (KnodelPrimeCordial.knodel 3 n) g := 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