AFTD Auto-Formalizing Theoretical Domains

digraph_common_predecessor_double_edges

def

The number of edges in the common-predecessor graph whose endpoints have exactly two common predecessors.

Statement

noncomputable def digraph_common_predecessor_double_edges
    (α : Type) [Fintype α] [DecidableEq α] (D : Digraph α) [DecidableRel D.Adj] : ℕ
Source
Triangle-free center budget for the four-cycle campaign.
Verified
03 Nov 2026
Axioms
none listed
Built on 1
Used by 4

Lean source view module on GitHub

noncomputable def digraph_common_predecessor_double_edges
    (α : Type) [Fintype α] [DecidableEq α] (D : Digraph α) [DecidableRel D.Adj] : ℕ := by
  classical
  exact ((digraph_common_predecessor_graph D).edgeFinset.filter fun e =>
    (Finset.univ.filter fun p => ∀ x, x ∈ e → D.Adj p x).card = 2).card
See it in the graphDiscuss this resultChallenge it