| dbpprop:abstract
|
- In graph theory, if <math>G</math> is a graph, and <math>k \ge 0</math> is an integer, a haven of order <math>k</math> in <math>G</math> is a function assigning to every set <math>X \subseteq V(G)</math> with <math>\big|X\big| < k</math> a vertex set of a component of <math>G \big\backslash X</math>, <math>\beta\big(X\big)</math>, such that if <math>X \subseteq Y \subseteq V(G)</math> and <math>\big|Y\big| < k</math>, then <math>\beta(Y) \subseteq \beta(X)</math>. The Min-max theorem for tree-width states that a graph has a haven of order <math>k</math> if and only if it has tree width at least <math>k - 1</math>.
|
![[RDF Data]](/statics/sw-cube.png)
