Cutting Planes Width and the Complexity of Graph Isomorphism Refutations

The width complexity measure plays a central role in resolution and other propositional proof systems like Polynomial Calculus (under the name of degree). The study of width lower bounds is the most used method for proving size lower bounds, and it is known that for the mentioned proof systems, proofs with small width also imply the existence of proofs with small size. Not much has been studied, however, about the width parameter in the cutting planes (CP) proof system, a measure that was introduced by Dantchev and Martin in 2009 under the name of CP cutwidth. In this article, we study the width complexity of CP refutations of graph isomorphism formulas. For a pair of non-isomorphic graphs G and H, we show a direct connection between the Weisfeiler-Leman differentiation number WL (G, H) of the graphs and the width of a CP refutation for the corresponding isomorphism formula width k, and if WL(G, H) > k, then there are no CP refutations of Iso(G, H) with width k - 2. Similar results are known for other proof systems, like Resolution, Sherali-Adams, or Polynomial Calculus. We also obtain polynomial-length CP refutations from our width bound for isomorphism formulas for graphs with constant Weisfeiler-Leman dimension. Furthermore, we notice that a length lower bound for refuting graph isomorphism formulas in the subsystem of tree-like cutting planes with polynomially bounded coefficients follows from known results.