AFTD Auto-Formalizing Theoretical Domains

digraph_out_count

def

The out-degree of the vertex v of a digraph on Fin n.

Statement

def digraph_out_count {n : ℕ} (D : Digraph (Fin n)) [DecidableRel D.Adj] (v : Fin n) : ℕ
Defined in
arXiv:2610.25886 (Extremal arborescences in graph orientations), Conjecture 6.1; outdegrees
Verified
20 Oct 2026
Axioms
none listed
Used by 19

Lean source view module on GitHub

/-- The out-degree of the vertex v of a digraph on Fin n. -/
def digraph_out_count {n : ℕ} (D : Digraph (Fin n)) [DecidableRel D.Adj] (v : Fin n) : ℕ := (Finset.univ.filter (fun w => D.Adj v w)).card
See it in the graphDiscuss this resultChallenge it