Nordhaus-Gaddum for Treewidth

Gwenaël Joret, David R. Wood

We prove that for every graph $G$ with $n$ vertices, the treewidth of $G$ plus the treewidth of the complement of $G$ is at least $n-2$. This bound is tight.