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
- digraph_common_predecessor_graphThe simple graph joining distinct vertices that have a common in-neighbor in the digraph.
- Used by 4
- digraph_trianglefree_weighted_good_centerUnder the displayed weighted overlap condition, a finite loopless oriented arc-dominated digraph of the specified girth has a clean…
- digraph_trianglefree_weighted_overlap_cycle_packing_stepFor a loopless oriented arc-dominated digraph of directed girth at least four, the k-cycle theorem at outdegree d implies a (k+1)-cycle…
- digraph_weighted_center_strict54_certificateThe displayed 54-vertex graph is loopless, oriented, triangle-free and arc-dominated, has minimum outdegree seven and auxiliary…
- digraph_trianglefree_arc_map_weighted_budgetFor a loopless oriented digraph of directed girth at least four with chosen common predecessors for its arcs, three times the number of…
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