is_total_edge_irregular_labeling
A vertex labeling φ : V → ℕ and an edge labeling ψ : G.edgeSet → ℕ form a total edge irregular s-labeling of a simple graph G if all vertex labels and edge labels are between 1 and s inclusive, and the total edge weights φ(u) + ψ(uv) + φ(v) are pairwise distinct for all edges uv of G.
Statement
def is_total_edge_irregular_labeling {V : Type*} (G : SimpleGraph V) (s : ℕ) (φ : V → ℕ) (ψ : G.edgeSet → ℕ) : Prop
- Defined in
- arXiv:2611.16338, Section 1
- Verified
- 14 Nov 2026
- Axioms
- none listed
- Used by 3
- admissibility_lemma_necessityLet s ≥ 3, let G be a finite simple graph, and let φ : V → ℕ be a vertex labeling such that φ(v) ∈ {1, s} for all v. Let a = |E_2|, b =…
- admissibility_lemma_binary_labelingLet s ≥ 3, let G be a finite simple graph, and let φ : V → ℕ be a vertex labeling such that φ(v) ∈ {1, s} for all v. Let a = |E_2|, b =…
- admissibility_lemma_sufficiencyLet s ≥ 3, let G be a finite simple graph, and let φ : V → ℕ be a vertex labeling such that φ(v) ∈ {1, s} for all v. Let a = |E_2|, b =…
Read back from the Lean
For a type V, a simple graph G on V, a natural number s, a vertex labeling φ : V → ℕ, and an edge labeling ψ : G.edgeSet → ℕ, is_total_edge_irregular_labeling G s φ ψ is the proposition that:
1. For every vertex v : V, 1 ≤ φ v and φ v ≤ s.
2. For every edge e : G.edgeSet, 1 ≤ ψ e and ψ e ≤ s.
3. For all edges e₁, e₂ : G.edgeSet, if the weight of e₁ equals the weight of e₂, then e₁ = e₂ (i.e., edge weights are distinct), where the weight of an edge is the sum of the label ψ e of the edge and the labels φ u + φ v of its two endpoints u and v.
Written by a model that saw only the Lean, never the English above. If the two disagree, that is worth a challenge.
Lean source view module on GitHub
/-- A total edge irregular s-labeling of a simple graph G. -/ def is_total_edge_irregular_labeling {V : Type*} (G : SimpleGraph V) (s : ℕ) (φ : V → ℕ) (ψ : G.edgeSet → ℕ) : Prop := (∀ v : V, 1 ≤ φ v ∧ φ v ≤ s) ∧ (∀ e : G.edgeSet, 1 ≤ ψ e ∧ ψ e ≤ s) ∧ ∀ (e₁ e₂ : G.edgeSet), Sym2.lift ⟨fun u v => φ u + φ v, fun _ _ => add_comm _ _⟩ e₁.val + ψ e₁ = Sym2.lift ⟨fun u v => φ u + φ v, fun _ _ => add_comm _ _⟩ e₂.val + ψ e₂ → e₁ = e₂