digraph_quasikernel_outneighbors
def
The first out-neighborhood of a finite set of vertices in a digraph.
Statement
def digraph_quasikernel_outneighbors {α : Type} [Fintype α] [DecidableEq α] (D : Digraph α) [DecidableRel D.Adj] (Q : Finset α) : Finset α
- Source
- Auxiliary lemma for the OP-337 campaign; standard finite digraph definitions and quasi-kernel exchange.
- Verified
- 03 Nov 2026
- Axioms
- none listed
- Used by 2
- digraph_quasikernel_outneighbors_two_dominateIn a finite loopless source-free digraph, the out-neighborhood of an independent two-step out-dominating set is itself two-step…
- digraph_minimum_quasikernel_independent_outneighbors_boundIf a minimum quasi-kernel in a finite loopless source-free digraph has an independent first out-neighborhood, that neighborhood has at…
Lean source view module on GitHub
def digraph_quasikernel_outneighbors {α : Type} [Fintype α] [DecidableEq α] (D : Digraph α) [DecidableRel D.Adj] (Q : Finset α) : Finset α := Finset.univ.filter fun v => ∃ q ∈ Q, D.Adj q v -- In a source-free digraph the first out-neighborhood of any quasi-kernel -- is itself two-step out-dominating, even when it is not independent.