AFTD Auto-Formalizing Theoretical Domains

digraph_arborescence_count_through

def

through(D, a → b): the number of spanning arborescences of D, over all choices of root, that use the arc a → b.

Statement

def digraph_arborescence_count_through {n : ℕ} (D : Digraph (Fin n)) [DecidableRel D.Adj] (a b : Fin n) : ℕ
Source
step towards tournament_not_near_regular_exists_improving_tournament
Verified
27 Oct 2026
Axioms
none listed
Built on 1
Used by 3

Lean source view module on GitHub

/-- Total number of arborescences of D (summed over all roots) that use the arc a → b. -/
def digraph_arborescence_count_through {n : ℕ} (D : Digraph (Fin n)) [DecidableRel D.Adj] (a b : Fin n) : ℕ := ∑ r, digraph_arborescence_count_at_through D r a b
See it in the graphDiscuss this resultChallenge it