Nordhaus-Gaddum for Treewidth
classification
🧮 math.CO
cs.DM
keywords
treewidthboundcomplementeverygraphleastnordhaus-gaddumplus
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.