Positive edge gcds from a labeling bijection
ProvedKnodelPrimeCordial.edge_gcd_positive_from_bij__p2m_730717b0_dc72_4b0f_b59f_ead0370cbb16_a1graph-labelingknodel-graphp2o-gran-per-chapterp2o-plan-paperp2o-v1prime-cordial
Every edge of knodel 3 8 has positive endpoint gcd when the vertex labels are bijective onto 1,…,8.
Preamble
import Mathlib import Definitions.Def_KnodelPrimeCordial_IsPrimeCordialLabeling import Definitions.Def_KnodelPrimeCordial_knodel
Formal statement
theorem KnodelPrimeCordial.edge_gcd_positive_from_bij__p2m_730717b0_dc72_4b0f_b59f_ead0370cbb16_a1 (f : Fin 2 × Fin 4 → ℕ) (hbij : Set.BijOn f Set.univ (Set.Icc 1 8)) : ∀ e ∈ (KnodelPrimeCordial.knodel 3 8).edgeFinset, 0 < KnodelPrimeCordial.edgeGcd f e := by sorry
Source
Haque, Khanam, Shahriar, Prime cordial labeling of Knödel graph, manuscript (2026) (held version, sha256 366502170d8d7c65ccc2fcc6f5373dac872d6efdc838ba9e671eb578e4c08c60), Lemma 2.1, p.3 (PDF p.3)