| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4654013 | European Journal of Combinatorics | 2011 | 8 Pages |
Abstract
We prove that when a digraph GG has a Maltsev polymorphism, then GG also has a majority polymorphism. We consider the consequences of this result for the structure of Maltsev digraphs and the complexity of the Constraint Satisfaction Problem.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Alexandr Kazda,