gamma_ve
def
The vertex-edge domination number gamma_ve(G) of a finite simple graph G is the minimum cardinality of a finite subset S of V that is a vertex-edge dominating set of G.
Statement
noncomputable def gamma_ve {V : Type*} [Fintype V] (G : SimpleGraph V) : ℕ
- Defined in
- arXiv:2610.26912 Section 1
- Verified
- 21 Oct 2026
- Axioms
- none listed
- Built on 1
- is_ve_dominatingA subset S of vertices in a simple graph G is a vertex-edge dominating set if for all vertices x and y with G.Adj x y, there exists u in S…
- Used by 3
- not_is_fix_v0_of_isolatedAn isolated vertex v in a finite simple graph G (with empty neighborhood) does not belong to V_fix^0(G).
- is_fix_v0A vertex v of a finite simple graph G belongs to V_fix^0(G) if v is in V^0(G) and v belongs to every minimum vertex-edge dominating set S…
- is_v0A vertex v of a finite simple graph G belongs to V^0(G) if removing v preserves the vertex-edge domination number, that is, gamma_ve(G -…
Read back from the Lean
For a finite type V and a simple graph G on V, gamma_ve G is defined as the infimum (sInf in ℕ) of the set of natural numbers k for which there exists a finite subset S : Finset V of cardinality k that is a vertex-edge dominating set (is_ve_dominating) of G.
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 vertex-edge domination number gamma_ve(G) is the minimum cardinality of a ve-dominating set of G. -/ noncomputable def gamma_ve {V : Type*} [Fintype V] (G : SimpleGraph V) : ℕ := sInf {k : ℕ | ∃ S : Finset V, is_ve_dominating G (S : Set V) ∧ S.card = k}