Intuitively, this means that every algorithmic technique or complexity result that applies to "H"-coloring problems for directed graphs "H" applies just as well to general CSPs. In particular, one can ask whether the Hell–Nešetřil theorem can be extended to directed graphs. By the above theorem, this is equivalent to the Feder–Vardi conjecture (aka CSP conjecture, dichotomy conjecture) on CSP dichotomy, which states that for every constraint language "Γ", CSP("Γ") is NP-complete or in P. This conjecture was proved in 2017 independently by Dmitry Zhuk and Andrei Bulatov, leading the following corollary: