Nordhaus–Gaddum for treewidth
Copyright policy )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.
FOS: Computer and information sciences, Extremal problems in graph theory, Distance in graphs, Discrete Mathematics (cs.DM), Trees, Theoretical Computer Science, Computational Theory and Mathematics, Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.), FOS: Mathematics, Théorie des graphes, Mathematics - Combinatorics, Geometry and Topology, Combinatorics (math.CO), Computer Science - Discrete Mathematics
FOS: Computer and information sciences, Extremal problems in graph theory, Distance in graphs, Discrete Mathematics (cs.DM), Trees, Theoretical Computer Science, Computational Theory and Mathematics, Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.), FOS: Mathematics, Théorie des graphes, Mathematics - Combinatorics, Geometry and Topology, Combinatorics (math.CO), Computer Science - Discrete Mathematics
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).3 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Average impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!