op869_predecessor_postdegree
def
The post-degree of a vertex in an ordered predecessor presentation is the number of later vertices that list it as a predecessor.
Statement
def op869_predecessor_postdegree {n : ℕ} (P : Fin n → Finset (Fin n)) (a : Fin n) : ℕ- Source
- arXiv:2610.41516, Section 2.2, post-degree controlled adaptive t-fold coloring simulation.
- Verified
- 11 Nov 2026
- Axioms
- none listed
- Used by 4
- op869_bounded_adversary_forces_unboundedA winning post-degree-bounded t-fold adversary position also wins the same game without the post-degree restriction.
- op869_bounded_adversary_one_vertexWhen n and k are positive, an isolated vertex forces t colors in the bounded t-fold game in one move, for every post-degree bound D.
- op869_bounded_fuel_monoIncreasing the number of remaining moves preserves a winning position in the bounded online coloring adversary game.
- op869_bounded_adversary_forcesThe bounded t-fold adversary game is the t-fold game where, after each move, every vertex has post-degree at most D.
Lean source view module on GitHub
def op869_predecessor_postdegree {n : ℕ} (P : Fin n → Finset (Fin n)) (a : Fin n) : ℕ := (Finset.univ.filter (fun b : Fin n => a < b ∧ a ∈ P b)).card