Achievable sets, brambles, and sparse treewidth obstructions

Brian Lucena

Abstract: One consequence of the graph minor theorem is that for every k there exists a finite obstruction set Obs(TW⩽k)<math><mtext is="true"><mi mathvariant="italic" is="true">Obs</mi></mtext><mo stretchy="false" is="true">(</mo><mi mathvariant="italic" is="true">TW</mi><mo is="true">⩽</mo><mi is="true">k</mi><mo stretchy="false" is="true">)</mo></math>. However, relatively little is known about these sets, and very few general obstructions are known. The ones that are known are the cliques, and graphs which are formed by removing a few edges from a clique. This paper gives several general constructions of minimal forbidden minors which are sparse in the sense that the ratio of the treewidth to the number of vertices n does not approach 1 as n approaches infinity. We accomplish this by a novel combination of using brambles to provide lower bounds and achievable sets to demonstrate upper bounds. Additionally, we determine the exact treewidth of other basic graph constructions which are not minimal forbidden minors.