H-coloring Dichotomy in Proof Complexity

Azza Gaysin

The $\mathcal{H}$-coloring problem for undirected simple graphs is a computational problem from a huge class of the constraint satisfaction problems (CSP): an $\mathcal{H}$-colorin…