AFTD Auto-Formalizing Theoretical Domains

sym2_edge_degree

def

The number of edges of a finite edge set F that are incident to a vertex v.

Statement

def sym2_edge_degree {V : Type*} [DecidableEq V] (F : Finset (Sym2 V)) (v : V) : ℕ
Source
step towards simple_graph_stable_packing_unforced_conflict_odd_cycle
Verified
09 Nov 2026
Axioms
none listed

Lean source view module on GitHub

/-- `sym2_edge_degree F v` is the number of edges in the edge set `F` incident to `v` (counting an edge once for each of its endpoints; `v ∈ e` is `Sym2.Mem`). -/
def sym2_edge_degree {V : Type*} [DecidableEq V] (F : Finset (Sym2 V)) (v : V) : ℕ := (F.filter (fun e => v ∈ e)).card
See it in the graphDiscuss this resultChallenge it