2 problems

Strong-tournament safe-set conjecture. The safe-set problem is NP-complete for strong tournaments.

Safe-set algorithm conjecture. There exists a polynomial-time algorithm to find a minimum safe set in a clique acyclic digraph with a constant independence number $\alpha$.