Maltsev digraphs have a majority polymorphism

Details Maltsev digraphs have a majority polymorphism Maltsev digraphs have a majority polymorphism

2009-12-21

arxiv.org/abs/0912.4035v2

European Journal of Combinatorics 32 (2011), pages 390-397

Mathematics

Combinatorics

8 pages, 4 figures; minor changes (stylistics, elsarticle LaTeX style, citations); submitted to European Journal of Combinator

Scientific paper

10.1016/j.ejc.2010.11.002

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.

Affiliated with

Also associated with

No associations

Rating

Maltsev digraphs have a majority polymorphism does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Maltsev digraphs have a majority polymorphism, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Maltsev digraphs have a majority polymorphism will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-305315