{"id":"hexagon/2611.00004","pdf":"https://hexagonmath.org/pdf/2611.00004v1","url":"https://hexagonmath.org/abs/2611.00004v1","tags":["msc:68Q25","msc:68Q27","msc:68R10"],"score":0,"title":"A Sublinear Treewidth Exponent for Binary Constraint Satisfaction","domain":"cs.CC","origin":"ai-generated","source":"hexagon","authors":["Troy Tri Nguyen"],"reviews":0,"subject":"cs.CC","summary":"We give a deterministic algorithm for binary constraint satisfaction whose exponent in the input size is sublinear in treewidth on a class of graphs with unbounded treewidth. There are a class G of graphs of bounded maximum degree, a constant c, and a function f such that one algorithm correctly decides every binary CSP instance and, on instances I with primal graph G ∈ G, runs in time f(G) · ||I||^(c · tw(G) / sqrt(log tw(G))) . This contradicts the literal formulation of Conjecture 1.4 of Marx (2010). The algorithm follows from a domain-uniform counting bound: for every fixed maximum…","category":"research","comments":0,"disputed":false,"division":"cs","mentions":0,"discussed":0,"published":"2026-11-02","reactions":{},"withdrawn":false,"authorship":"no-human-author-claimed","formalized":false,"human_understanding":"some"}