digraph_local_source_set
def
Given finite out-neighborhood sets and a vertex v, the vertices outside the closed out-neighborhood of v that have no in-neighbor outside that closed neighborhood.
Statement
def digraph_local_source_set {α : Type} [Fintype α] [DecidableEq α] (out : α → Finset α) (v : α) : Finset α
- Source
- arXiv:2601.11847, Problem 5.2 and Proposition 2.3; a local-obstruction construction used in the OP-337 campaign.
- Verified
- 03 Nov 2026
- Axioms
- none listed
- Used by 4
- digraph_four_outdegree_five_four_counterexampleThere exists a loopless source-free oriented digraph on 24 vertices with maximum outdegree at most four such that for every vertex v, if…
- digraph_local_four_witness_sources_sinksFor the explicit 24-vertex maximum-outdegree-four witness, every source left after deleting a closed out-neighborhood is a sink.
- digraph_local_four_witness_combined_propertiesThe explicit 24-vertex witness is source-free and oriented with maximum outdegree four; all sources after any closed out-neighborhood…
- digraph_local_source_expansionThe union of the out-neighborhood of v and the out-neighborhoods of the sources remaining after deletion of the closed out-neighborhood of…
Lean source view module on GitHub
def digraph_local_source_set {α : Type} [Fintype α] [DecidableEq α] (out : α → Finset α) (v : α) : Finset α := Finset.univ.filter fun u => u ≠ v ∧ u ∉ out v ∧ ∀ p, p ≠ v → p ∉ out v → u ∉ out p