total_edge_irregularity_strength
The total edge irregularity strength of a simple graph G is the least positive integer s such that G admits a total edge irregular s-labeling.
Statement
noncomputable def total_edge_irregularity_strength {V : Type*} (G : SimpleGraph V) : ℕ
- Defined in
- arXiv:2611.16338 Section 1
- Verified
- 15 Nov 2026
- Axioms
- none listed
- Built on 1
- is_total_edge_irregular_labelingA vertex labeling φ : V → ℕ and an edge labeling ψ : G.edgeSet → ℕ form a total edge irregular s-labeling of a simple graph G if all…
- Used by 1
- cubic_total_edge_irregularity_strength_lower_boundEvery finite simple graph G on a finite type V that is regular of degree 3 satisfies Fintype.card V / 2 + 1 ≤…
Read back from the Lean
For a simple graph G on a vertex type V, total_edge_irregularity_strength G is defined as the infimum (in ℕ, yielding the minimum, or 0 if the set is empty) of the set of all positive natural numbers s such that there exist a vertex labeling φ : V → ℕ and an edge labeling ψ : G.edgeSet → ℕ satisfying:
1. for all v : V, 1 ≤ φ v and φ v ≤ s;
2. for all e : G.edgeSet, 1 ≤ ψ e and ψ e ≤ s; and
3. for all edges e₁, e₂ : G.edgeSet, if φ u₁ + φ v₁ + ψ e₁ = φ u₂ + φ v₂ + ψ e₂ (where e₁ = s(u₁, v₁) and e₂ = s(u₂, v₂)), then e₁ = e₂ (all edge weights are distinct).
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
/-- The total edge irregularity strength tes(G) of a simple graph G is the minimum positive integer s admitting a total edge irregular s-labeling. -/ noncomputable def total_edge_irregularity_strength {V : Type*} (G : SimpleGraph V) : ℕ := sInf {s : ℕ | 0 < s ∧ ∃ (φ : V → ℕ) (ψ : G.edgeSet → ℕ), is_total_edge_irregular_labeling G s φ ψ}