Nordhaus–Gaddum for treewidth

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