AFTD Auto-Formalizing Theoretical Domains

digraph_common_out_count

def

c_ij: the number of common out-neighbours of the vertices i and j of a digraph on Fin n.

Statement

def digraph_common_out_count {n : ℕ} (D : Digraph (Fin n)) [DecidableRel D.Adj]
    (i j : Fin n) : ℕ
Defined in
arXiv:2610.25886 (Extremal arborescences in graph orientations), Conjecture 6.1; the counts c_ij of Sec. 6
Verified
20 Oct 2026
Axioms
none listed
Used by 1

Lean source view module on GitHub

/-- c_ij: the number of common out-neighbours of the vertices i and j of a digraph on Fin n. -/
def digraph_common_out_count {n : ℕ} (D : Digraph (Fin n)) [DecidableRel D.Adj]
    (i j : Fin n) : ℕ :=
  (Finset.univ.filter (fun v => D.Adj i v ∧ D.Adj j v)).card
See it in the graphDiscuss this resultChallenge it