DeepAI AI Chat
Log In Sign Up

Digraphs Homomorphism Problems with Maltsev Condition

by   Jeff Kinne, et al.

We consider a generalization of finding a homomorphism from an input digraph G to a fixed digraph H, HOM(H). In this setting, we are given an input digraph G together with a list function from G to 2^H. The goal is to find a homomorphism from G to H with respect to the lists if one exists. We show that if the list function is a Maltsev polymorphism then deciding whether G admits a homomorphism to H is polynomial time solvable. In our approach, we only use the existence of the Maltsev polymorphism. Furthermore, we show that deciding whether a relational structure ℛ admits a Maltsev polymorphism is a special case of finding a homormphism from a graph G to a graph H and a list function with a Maltsev polymorphism. Since the existence of Maltsev is not required in our algorithm, we can decide in polynomial time whether the relational structure ℛ admits Maltsev or not. We also discuss forbidden obstructions for the instances admitting Maltsev list polymorphism. We have implemented our algorithm and tested on instances arising from linear equations, and other types of instances.


page 22

page 23

page 24

page 25

page 26


Digraph homomorphism problem and weak near unanimity polymorphism

We consider the problem of finding a homomorphism from an input digraph ...

Solving Graph Isomorphism Problem for a Special case

Graph isomorphism is an important computer science problem. The problem ...

Graph Motif Problems Parameterized by Dual

Let G=(V,E) be a vertex-colored graph, where C is the set of colors used...

Deciding the existence of quasi weak near unanimity terms in finite algebras

We show that for a fixed positive integer k one can efficiently decide i...

List k-Colouring P_t-Free Graphs with No Induced 1-Subdivision of K_1,s: a Mim-width Perspective

A colouring of a graph G=(V,E) is a mapping c V→{1,2,…} such that c(u)≠ ...

Embedding graphs into two-dimensional simplicial complexes

We consider the problem of deciding whether an input graph G admits a to...

Recognizing when a preference system is close to admitting a master list

A preference system ℐ is an undirected graph where vertices have prefere...