Edges incident to labels 1, 5, or 7 are coprime
ProvedKnodelPrimeCordial.knodel_3_8_incident_edges_are_coprime__p2m_a761614d_f372_42a3_bd68_c80e83f4ad67_a2graph-labelingknodel-graphp2o-gran-per-chapterp2o-plan-paperp2o-v1prime-cordial
Under a bijection onto 1,…,8, every edge incident to a vertex labeled 1, 5, or 7 has coprime endpoint labels.
Preamble
import Mathlib import Definitions.Def_KnodelPrimeCordial_PrimeCordial import Definitions.Def_KnodelPrimeCordial_knodel
Formal statement
theorem KnodelPrimeCordial.knodel_3_8_incident_edges_are_coprime__p2m_a761614d_f372_42a3_bd68_c80e83f4ad67_a2 (f : Fin 2 × Fin 4 → ℕ) (hbij : Set.BijOn f Set.univ (Set.Icc 1 8)) (x y z : Fin 2 × Fin 4) (hx : f x = 1) (hy : f y = 5) (hz : f z = 7) :
((KnodelPrimeCordial.knodel 3 8).edgeFinset.filter (fun e => x ∈ e ∨ y ∈ e ∨ z ∈ e)) ⊆
KnodelPrimeCordial.edgesLabelOne (KnodelPrimeCordial.knodel 3 8) f := by sorrySource
Haque, Khanam, Shahriar, Prime cordial labeling of Knödel graph, manuscript (2026) (held version, sha256 366502170d8d7c65ccc2fcc6f5373dac872d6efdc838ba9e671eb578e4c08c60), Lemma 2.1, p.3 (PDF p.3)