Tight Bounds for Counting Colorings and Connected Edge Sets Parameterized by Cutwidth

Abstract

We study the fine-grained complexity of counting the number of colorings and connected spanning edge sets parameterized by the cutwidth and treewidth of the graph. While decompositions of small treewidth decompose the graph with small vertex separators, decompositions with small cutwidth decompose the graph with small edge separators. Let p, q ∈ N such that p is a prime and q ≥ 3. We show: If p divides q - 1, there is a (q - 1)ctwnO(1) time algorithm for counting list q-colorings modulo p of n-vertex graphs of cutwidth ctw. Furthermore, there is no ε > 0 for which there is a (q - 1 - ε)ctwnO(1) time algorithm that counts the number of list q-colorings modulo p of n-vertex graphs of cutwidth ctw, assuming the Strong Exponential Time Hypothesis (SETH). If p does not divide q - 1, there is no ε > 0 for which there exists a (q - ε)ctwnO(1) time algorithm that counts the number of list q-colorings modulo p of n-vertex graphs of cutwidth ctw, assuming SETH. The lower bounds are in stark contrast with the existing 2ctwnO(1) time algorithm to compute the chromatic number of a graph by Jansen and Nederlof [Theor. Comput. Sci.’18]. Furthermore, by building upon the above lower bounds, we obtain the following lower bound for counting connected spanning edge sets: there is no ε > 0 for which there is an algorithm that, given a graph G and a cutwidth ordering of cutwidth ctw, counts the number of spanning connected edge sets of G modulo p in time (p - ε)ctwnO(1), assuming SETH. We also give an algorithm with matching running time for this problem. Before our work, even for the treewidth parameterization, the best conditional lower bound by Dell et al. [ACM Trans. Algorithms’14] only excluded 2o(tw)nO(1) time algorithms for this problem. Both our algorithms and lower bounds employ use of the matrix rank method, by relating the complexity of the problem to the rank of a certain “compatibility matrix” in a non-trivial way.