Dichotomy for Digraph Homomorphism Problems

  title={Dichotomy for Digraph Homomorphism Problems},
  author={Arash Rafiey and Jeff Kinne and Tom{\'a}s Feder},
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 confirms the conjecture of Bulatov, Jeavons, and Krokhin [BJK05], in the form postulated by Maroti and McKenzie [MM08], and consequently implies the validity of the celebrated dichotomy conjecture due to Feder and Vardi [FV93]. We transform the… CONTINUE READING
Highly Cited
This paper has 18 citations. REVIEW CITATIONS

6 Figures & Tables



Citations per Year

Citation Velocity: 10

Averaging 10 citations per year over the last 2 years.

Learn more about how we calculate this metric in our FAQ.