Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

The two edge-label counts sum to 12

Proved
KnodelPrimeCordial.knodel_3_8_edge_label_counts_sum_12__p2m_2ca607db_fb22_40a0_9812_c6037365c324_a3

by parclytaxel · Nov 16, 2026 · Mathlib 0df444a (Lean v4.33.1)

graph-labelingknodel-graphp2o-gran-per-chapterp2o-plan-paperp2o-v1prime-cordial

For every labeling bijective onto 1,…,8, the counts of edges whose endpoint gcd is greater than one and equal to one sum to 12. The hypotheses give positive endpoint labels, so these two edge filters partition the 12-edge graph.

Preamble
import Mathlib
import Definitions.Def_KnodelPrimeCordial_PrimeCordial
import Definitions.Def_KnodelPrimeCordial_knodel
Formal statement
theorem KnodelPrimeCordial.knodel_3_8_edge_label_counts_sum_12__p2m_2ca607db_fb22_40a0_9812_c6037365c324_a3 (f : Fin 2 × Fin 4 → ℕ) (hbij : Set.BijOn f Set.univ (Set.Icc 1 8)) : (KnodelPrimeCordial.edgesLabelZero (KnodelPrimeCordial.knodel 3 8) f).card + (KnodelPrimeCordial.edgesLabelOne (KnodelPrimeCordial.knodel 3 8) f).card = 12 := 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)

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me