In mathematics, the graph structure theorem is a major result in the area of graph theory. The result establishes a deep and fundamental connection between the theory of graph minors and topological embeddings. The theorem is stated in the seventeenth of a series of 23 papers by Neil Robertson and Paul Seymour. Its proof is very long and involved. and are surveys accessible to nonspecialists, describing the theorem and its consequences.
Setup and motivation for the theorem
A minor of a graph is any graph that is isomorphic to a graph that can be obtained from a subgraph of by contracting some edges. If does not have a graph as a minor, then we say that is -free. Let be a fixed graph. Intuitively, if is a huge -free graph, then there ought to be a "good reason" for this. The graph structure theorem provides such a "good reason" in the form of a rough description of the structure of . In essence, every -free graph suffers from one of two structural deficiencies: either is "too thin" to have as a minor, or can be (almost) topologically embedded on a surface that is too simple to embed upon. The first reason applies if is a planar graph, and both reasons apply if is not planar. We first make precise these notions.
Tree width
The tree width of a graph is a positive integer that specifies the "thinness" of . For example, a connected graph has tree width one if and only if it is a tree, and has tree width two if and only if it is a series–parallel graph. Intuitively, a huge graph has small tree width if and only if takes the structure of a huge tree whose nodes and edges have been replaced by small graphs. We give a precise definition of tree width in the subsection regarding clique-sums. It is a theorem that if is a minor of , then the tree width of is not greater than that of . Therefore, one "good reason" for to be -free is that the tree width of is not very large. The graph structure theorem implies that this reason always applies in case is planar.
Corollary 1. For every planar graph , there exists a positive integer such that every -free graph has tree width less than .
It is unfortunate that the value of in Corollary 1 is generally much larger than the tree width of (a notable exception is when , the complete graph on four vertices, for which ). This is one reason that the graph structure theorem is said to describe the "rough structure" of -free graphs.
Surface embeddings
Roughly, a surface is a set of points with a local topological structure of a disc. Surfaces fall into two infinite families: the orientable surfaces include the sphere, the torus, the double torus and so on; the nonorientable surfaces include the real projective plane, the Klein bottle and so on. A graph embeds on a surface if the graph can be drawn on the surface as a set of points (vertices) and arcs (edges) that do not cross or touch each other, except where edges and vertices are incident or adjacent. A graph is planar if it embeds on the sphere. If a graph embeds on a particular surface then every minor of also embeds on that same surface. Therefore, a "good reason" for to be -free is that embeds on a surface that does not embed on.
When is not planar, the graph structure theorem may be looked at as a vast generalization of the Kuratowski theorem. A version of this theorem proved by states that if a graph is both -free and -free, then is planar. This theorem provides a "good reason" for a graph not to have or as minors; specifically, embeds on the sphere, whereas neither nor embed on the sphere. Unfortunately, this notion of "good reason" is not sophisticated enough for the graph structure theorem. Two more notions are required: clique-sums and vortices.
Clique-sums
A clique in a graph is any set of vertices that are pairwise adjacent in . For a non-negative integer , a -clique-sum of two graphs and is any graph obtained by selecting a non-negative integer , selecting clique of size in each of and , identifying the two cliques into a single clique of size , then deleting zero or more of the edges that join vertices in the new clique.
If is a list of graphs, then we may produce a new graph by joining the list of graphs via -clique-sums. That is, we take a -clique-sum of and , then take a -clique-sum of with the resulting graph, and so on. A graph has tree width at most if it can be obtained via -clique-sums from a list of graphs, where each graph in the list has at most vertices.