Weak near-unanimity and constraint satisfaction problems

Miklos Maroti

University Szeged

Abstract

We will discuss how weak near-unanimity operations can be used to prove the NP-completeness of constraint satisfaction problems. As an application, we will outline the proof of dichotomy for a class of graphs, called special triads.