AFTD Auto-Formalizing Theoretical Domains

digraph_cut_count

def

e_G(A, B): the number of edges of the digraph G from a vertex of A to a vertex of B.

Statement

def digraph_cut_count {V : Type*} [Fintype V] (G : Digraph V) [DecidableRel G.Adj]
    (A B : Finset V) : ℕ
Defined in
arXiv:2610.21381 (Optimally large cuts in both directions), Sec. 1 (notation e_G(A, B)).
Verified
16 Oct 2026
Axioms
none listed
Used by 17

Lean source view module on GitHub

/-- `e_G(A, B)`: the number of arcs `u → v` of `G` with `u ∈ A` and `v ∈ B`. -/
def digraph_cut_count {V : Type*} [Fintype V] (G : Digraph V) [DecidableRel G.Adj]
    (A B : Finset V) : ℕ :=
  ((A ×ˢ B).filter fun p => G.Adj p.1 p.2).card
See it in the graphDiscuss this resultChallenge it