Digraph homomorphism problem and weak near unanimity polymorphism

09/28/2020

∙

by   Tomas Feder, et al.

∙

0

∙

share

We consider the problem of finding a homomorphism from an input digraph G to a fixed digraph H. We show that if H admits a weak near unanimity polymorphism ϕ then deciding whether G admits a homomorphism to H (HOM(H)) is polynomial-time solvable. This gives proof of the dichotomy conjecture (now dichotomy theorem) by Feder and Vardi. Our approach is combinatorial, and it is simpler than the two algorithms found by Bulatov and Zhuk. We have implemented our algorithm and show some experimental results. We use our algorithm together with the recent result [38] for recognition of Maltsev polymorphisms and decide in polynomial time if a given relational structure ℛ admits a weak near unanimity polymorphism.