Edited by R. A. Bailey
Publisher: Cambridge University Press
Print Publication Year: 1997
Online Publication Date:March 2010
Chapter DOI: http://dx.doi.org/10.1017/CBO9780511662119.006
Summary We discuss tree width, a new connectivity invariant of graphs defined by Robertson and Seymour. We present a duality result and a canonical decomposition theorem tied to this invariant. We also discuss a number of applications of these results, including Robertson and Seymour's Graph Minors Project.
A taste of things to come
A graph is a set of vertices and an adjacency relation which indicates which pairs of vertices are joined by an edge. Thus, graph theory is essentially the study of connectivity. How then does one measure the connectivity of a graph?
Measuring the connectivity between two vertices is straightforward. Two vertices are said to be k-connected if there are k internally vertex disjoint paths between them. A classical theorem of Menger  states that vertices a and b are k-connected in a graph G precisely if there is no set X of fewer than k vertices such that a and b lie in different components of G – X. Standard alternating paths techniques, see e.g. , allow us to find either k internally vertex disjoint a-b paths or such a set X efficiently.
An appropriate definition of a highly connected graph, or of a highly connected piece of a graph is more difficult. The classical approach is to call a graph k-connected if every pair of its vertices is k-connected. This definition, although natural, does not capture the kind of connectivity that will concern us. It focuses on local properties rather than global ones.