# Extension Complexity, MSO Logic, and Treewidth

@inproceedings{Kolman2016ExtensionCM,
title={Extension Complexity, MSO Logic, and Treewidth},
author={P. Kolman and M. Kouteck{\'y} and Hans Raj Tiwary},
booktitle={SWAT},
year={2016}
}
• Published in SWAT 2016
• Mathematics, Computer Science
• We consider the convex hull $P_{\varphi}(G)$ of all satisfying assignments of a given MSO formula $\varphi$ on a given graph $G$. We show that there exists an extended formulation of the polytope $P_{\varphi}(G)$ that can be described by $f(|\varphi|,\tau)\cdot n$ inequalities, where $n$ is the number of vertices in $G$, $\tau$ is the treewidth of $G$ and $f$ is a computable function depending only on $\varphi$ and $\tau.$ In other words, we prove that the extension complexity of \$P_{\varphi… CONTINUE READING

#### References

##### Publications referenced by this paper.
SHOWING 1-10 OF 79 REFERENCES