Maltsev digraphs have a majority polymorphism
Combinatorics
2011-09-20 v2
Abstract
We prove that when a digraph has a Maltsev polymorphism, then also has a majority polymorphism. We consider the consequences of this result for the structure of Maltsev graphs and the complexity of the Constraint Satisfaction Problem.
Keywords
Cite
@article{arxiv.0912.4035,
title = {Maltsev digraphs have a majority polymorphism},
author = {Alexandr Kazda},
journal= {arXiv preprint arXiv:0912.4035},
year = {2011}
}
Comments
8 pages, 4 figures; minor changes (stylistics, elsarticle LaTeX style, citations); submitted to European Journal of Combinatorics