Maltsev digraphs have a majority polymorphism

TL;DR

This paper proves that digraphs with a Maltsev polymorphism also possess a majority polymorphism, impacting the understanding of their structure and the complexity of related constraint satisfaction problems.

Contribution

It establishes that Maltsev polymorphisms imply the existence of majority polymorphisms in digraphs, revealing a key structural property.

Findings

Maltsev polymorphism implies majority polymorphism in digraphs

Results influence the complexity analysis of the Constraint Satisfaction Problem

Provides structural insights into Maltsev graphs

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 graphs and the complexity of the Constraint Satisfaction Problem.