Maltsev digraphs have a majority polymorphism

DOI10.1016/j.ejc.2010.11.002zbMath1214.05043arXiv0912.4035OpenAlexW1976017655MaRDI QIDQ627926

Alexandr Kazda

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

zbMATH Keywords

Maltsev polymorphism

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20)

Related Items (12)

Quantified Constraint Satisfaction Problem on Semicomplete Digraphs ⋮ Complexity and polymorphisms for digraph constraint problems under some basic constructions ⋮ Dualities and algebras with a near-unanimity term ⋮ Unnamed Item ⋮ The smallest hard trees ⋮ Binarisation for Valued Constraint Satisfaction Problems ⋮ Reflexive digraphs with near unanimity polymorphisms ⋮ Quantified Constraints in Twenty Seventeen ⋮ Algebra and the Complexity of Digraph CSPs: a Survey ⋮ 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

This page was built for publication: Maltsev digraphs have a majority polymorphism