Dichotomies for \#CSP on graphs that forbid a clique as a minor

Boning Meng, Yicheng Pan

We prove complexity dichotomies for \#CSP problems (not necessarily symmetric) with Boolean domain and complex range on several typical minor-closed graph classes. These dichotomie…