Nordhaus-Gaddum for Treewidth
  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. 
Gwena\"el Joret and David R. Wood
math.CO cs.DM