Three vertices meet at least seven edges in W₃,₈
ProvedKnodelPrimeCordial.knodel_3_8_three_vertices_incident_edges_lower_bound__p2m_a761614d_f372_42a3_bd68_c80e83f4ad67_a2graph-labelingknodel-graphp2o-gran-per-chapterp2o-plan-paperp2o-v1prime-cordial
In W₃,₈, any three distinct vertices are incident to at least seven distinct edges.
Preamble
import Mathlib import Definitions.Def_KnodelPrimeCordial_knodel
Formal statement
theorem KnodelPrimeCordial.knodel_3_8_three_vertices_incident_edges_lower_bound__p2m_a761614d_f372_42a3_bd68_c80e83f4ad67_a2 (x y z : Fin 2 × Fin 4) (hxy : x ≠ y) (hxz : x ≠ z) (hyz : y ≠ z) :
7 ≤ ((KnodelPrimeCordial.knodel 3 8).edgeFinset.filter (fun e => x ∈ e ∨ y ∈ e ∨ z ∈ e)).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)