Prime cordiality of the cyclic model in residue class modulo
ProvedKnodelPrimeCordial.case_mod_0_cyc_cordialIn residue class modulo twelve, the Lemma 2.3 labeling is a prime cordial labeling of the cyclic model, with exactly edges of each label.
Let be a multiple of twelve and let be the labeling of Lemma 2.3. A prime cordial labeling of a finite simple graph on vertices is a bijection to such that, once every edge is assigned label when and label when , the two edge counts differ by at most one. The statement is that is such a labeling of the cyclic model , and in fact the two counts are equal:
Role. This is Case 1 of the proof of Lemma 2.3. Transporting it along the cyclic model isomorphism gives prime cordiality of itself, which is the residue-class- branch of the mission.
Formalization Note The cyclic model is cyc n on Fin n and the labeling is labelF. Prime cordiality is IsPrimeCordialLabeling; its edge counts are edgesLabelZero and edgesLabelOne.
import Mathlib import Definitions.Def_KnodelPrimeCordial_IsPrimeCordialLabeling import Definitions.Def_KnodelPrimeCordial_cyc import Definitions.Def_KnodelPrimeCordial_labelF
namespace KnodelPrimeCordial
theorem case_mod_0_cyc_cordial (n : ℕ) (hn : 0 < n) (h12 : 12 ∣ n) :
IsPrimeCordialLabeling (cyc n) (fun i : Fin n => labelF i.val) := by sorry
end KnodelPrimeCordial