Maltsev digraphs have a majority polymorphism

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.