Positive edge gcds partition the edge count
ProvedKnodelPrimeCordial.edge_label_partition__p2m_730717b0_dc72_4b0f_b59f_ead0370cbb16_a1graph-labelingknodel-graphp2o-gran-per-chapterp2o-plan-paperp2o-v1prime-cordial
For a finite simple graph whose edge endpoint gcds are all positive, the counts of edges with gcd greater than one and gcd equal to one sum to the graph's edge count.
Preamble
import Mathlib import Definitions.Def_KnodelPrimeCordial_IsPrimeCordialLabeling
Formal statement
theorem KnodelPrimeCordial.edge_label_partition__p2m_730717b0_dc72_4b0f_b59f_ead0370cbb16_a1 {V : Type*} [Fintype V] [DecidableEq V] (G : SimpleGraph V) [DecidableRel G.Adj] (f : V → ℕ) (hpos : ∀ e ∈ G.edgeFinset, 0 < KnodelPrimeCordial.edgeGcd f e) : (KnodelPrimeCordial.edgesLabelZero G f).card + (KnodelPrimeCordial.edgesLabelOne G f).card = G.edgeFinset.card := 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)