Title of article
Maltsev digraphs have a majority polymorphism
Author/Authors
Kazda، نويسنده , , Alexandr، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2011
Pages
8
From page
390
To page
397
Abstract
We prove that when a digraph G has a Maltsev polymorphism, then G 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.
Journal title
European Journal of Combinatorics
Serial Year
2011
Journal title
European Journal of Combinatorics
Record number
1547794
Link To Document