Bounded Treewidth and Complete Monotonicity for Scott-Sokal Spanning-Tree Polynomials

Domingos S. P. Salazar

Scott and Sokal asked for a structural description of the finite graphs \(G\) for which inverse powers \(T_G^{-β}\) of the spanning-tree polynomial are completely monotone. We prov…