Maltsev digraphs have a majority polymorphism
From MaRDI portal
Publication:627926
DOI10.1016/j.ejc.2010.11.002zbMath1214.05043arXiv0912.4035MaRDI QIDQ627926
Publication date: 4 March 2011
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0912.4035
05C20: Directed graphs (digraphs), tournaments
Related Items
Unnamed Item, Unnamed Item, Unnamed Item, Quantified Constraint Satisfaction Problem on Semicomplete Digraphs, Complexity and polymorphisms for digraph constraint problems under some basic constructions, Binarisation for Valued Constraint Satisfaction Problems, Dualities and algebras with a near-unanimity term, Reflexive digraphs with near unanimity polymorphisms, The structure of polynomial operations associated with smooth digraphs., On Maltsev digraphs, On Maltsev Digraphs
Cites Work
- Unnamed Item
- Unnamed Item
- On the algebraic structure of combinatorial problems
- Majority constraints have bounded pathwidth duality
- The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory
- Constraint Satisfaction Problems of Bounded Width
- Classifying the Complexity of Constraints Using Finite Algebras
- Datalog and Constraint Satisfaction with Infinite Templates
- A Simple Algorithm for Mal'tsev Constraints