Nordhaus-Gaddum for Treewidth
Abstract
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.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.