UWSpace is currently experiencing technical difficulties resulting from its recent migration to a new version of its software. These technical issues are not affecting the submission and browse features of the site. UWaterloo community members may continue submitting items to UWSpace. We apologize for the inconvenience, and are actively working to resolve these technical issues.
 

Connectivity, tree-decompositions and unavoidable-minors

Thumbnail Image

Files

Joeris_Benson.pdf (1.54 MB)

Date

2015-05-06

Authors

Joeris, Benson

Journal Title

Journal ISSN

Volume Title

Publisher

University of Waterloo

Abstract

The results in this thesis are steps toward bridging the gap between the handful of exact structure theorems known for minor-closed classes of graphs, and the very general, yet wildly qualitative, Graph Minors Structure Theorem. This thesis introduces a refinement of the notion of tree-width. Tree-width is a measure of how “tree-like” a graph is. Essentially, a graph is tree-like if it can be decomposed across a collection of non-crossing vertex-separations into small pieces. In our variant, which we call k-tree-width, we require that the vertex-separations each have order at most k. Tree-width and branch-width are related parameters in a graph, and we introduce a branch-width-like variant for k-tree-width. We find a dual notion, in terms of tangles, for our branch-width parameter, and we prove a generalization of Robertson and Seymour’s Grid Theorem.

Description

Keywords

Graph, K6, tree-decomposition, branch-decomposition, unavoidable-minor, tangle, minor

LC Keywords

Citation

URI

http://hdl.handle.net/10012/9315

Collections

Theses
Combinatorics and Optimization