Maltsev digraphs have a majority polymorphism
classification
🧮 math.CO
keywords
maltsevpolymorphismmajoritycomplexityconsequencesconsiderconstraintdigraph
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.