AFTD Auto-Formalizing Theoretical Domains

digraph_common_predecessor_girth_correction

def

The sum, over common-predecessor edges of multiplicity at least two, of the positive part of g+1 minus twice the number of common predecessors.

Statement

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

Lean source view module on GitHub

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