Maltsev digraphs have a majority polymorphism

Authors:
Alexandr Kazda
Affiliations:
-
Venue:
European Journal of Combinatorics
Year:
2011

Citing 8
Cited 2

On the algebraic structure of combinatorial problems

Theoretical Computer Science
The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory

SIAM Journal on Computing
Classifying the Complexity of Constraints Using Finite Algebras

SIAM Journal on Computing
A Simple Algorithm for Mal'tsev Constraints

SIAM Journal on Computing
Majority constraints have bounded pathwidth duality

European Journal of Combinatorics
Maltsev + Datalog -- Symmetric Datalog

LICS '08 Proceedings of the 2008 23rd Annual IEEE Symposium on Logic in Computer Science
Constraint Satisfaction Problems of Bounded Width

FOCS '09 Proceedings of the 2009 50th Annual IEEE Symposium on Foundations of Computer Science
Datalog and constraint satisfaction with infinite templates

STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science

On Maltsev digraphs

CSR'11 Proceedings of the 6th international conference on Computer science: theory and applications
The dichotomy of list homomorphisms for digraphs

Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms

Quantified Score

Hi-index	0.00

Visualization

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.