Graph Minor Theory

A monumental project in graph theory was recently completed. The project, started by Robertson and Seymour, and later joined by Thomas, led to entirely new concepts and a new way of looking at graph theory. The motivating problem was Kuratowski’s characterization of planar graphs, and a far-reaching generalization of this, conjectured by Wagner: If a class of graphs is minor-closed (i.e., it is closed under deleting and contracting edges), then it can be characterized by a finite number of excluded minors. The proof of this conjecture is based on a very general theorem about the structure of large graphs: If a minor-closed class of graphs does not contain all graphs, then every graph in it is glued together in a tree-like fashion from graphs that can almost be embedded in a fixed surface. We describe the precise formulation of the main results and survey some of its applications to algorithmic and structural problems in graph theory.

[1]  K. Wagner.  Über eine Eigenschaft der ebenen Komplexe , 1937 .

[2]  G. Dirac.  A Property of 4-Chromatic Graphs and some Remarks on Critical Graphs , 1952 .

[3]  J. Kruskal.  Well-quasi-ordering, the Tree Theorem, and Vazsonyi’s conjecture , 1960 .

[4]  C. Nash-Williams.  On well-quasi-ordering infinite trees , 1963, Mathematical Proceedings of the Cambridge Philosophical Society.

[5]  Joseph B. Kruskal,et al.  The Theory of Well-Quasi-Ordering: A Frequently Discovered Concept , 1972, J. Comb. Theory A.

[6]  Paul D. Seymour,et al.  Decomposition of regular matroids , 1980, J. Comb. Theory, Ser. B.

[7]  Paul D. Seymour,et al.  Graph minors. III. Planar tree-width , 1984, J. Comb. Theory B.

[8]  Paul D. Seymour,et al.  Graph minors. V. Excluding a planar graph , 1986, J. Comb. Theory B.

[9]  Dan Archdeacon,et al.  A Kuratowski theorem for nonorientable surfaces , 1989, J. Comb. Theory, Ser. B.

[10]  Stefan Arnborg,et al.  Linear time algorithms for NP-hard problems restricted to partial k-trees , 1989, Discret. Appl. Math..

[11]  Paul D. Seymour,et al.  Graph minors. VIII. A kuratowski theorem for general surfaces , 1990, J. Comb. Theory, Ser. B.

[12]  Paul D. Seymour,et al.  Graph minors. IV. Tree-width and well-quasi-ordering , 1990, J. Comb. Theory, Ser. B.

[13]  Paul D. Seymour,et al.  Graph minors. IX. Disjoint crossed paths , 1990, J. Comb. Theory, Ser. B.

[14]  Paul D. Seymour,et al.  Graph minors. X. Obstructions to tree-decomposition , 1991, J. Comb. Theory, Ser. B.

[15]  Neil Robertson,et al.  Graph Minors .XIII. The Disjoint Paths Problem , 1995, J. Comb. Theory B.

[16]  Robin Thomas,et al.  Sachs' Linkless Embedding Conjecture , 1995, J. Comb. Theory B.

[17]  Béla Bollobás,et al.  Highly linked graphs , 1996, Comb..

[18]  Gérard Cornuéjols,et al.  Decomposition of Balanced Matrices , 1999, J. Comb. Theory, Ser. B.

[19]  Bojan Mohar,et al.  A Linear Time Algorithm for Embedding Graphs in an Arbitrary Surface , 1999, SIAM J. Discret. Math..

[20]  Paul D. Seymour,et al.  Graph Minors: XVII. Taming a Vortex , 1999, J. Comb. Theory, Ser. B.

[21]  M. Conforti.  Balanced 0 ; 1 Matrices Part I : Decomposition , 2000 .

[22]  Bojan Mohar,et al.  Graph minors and graphs on surfaces , 2001 .

[23]  Neil Robertson,et al.  Graph Minors. XVIII. Tree-decompositions and well-quasi-ordering , 2003, J. Comb. Theory, Ser. B.

[24]  Paul D. Seymour,et al.  Graph Minors. XVI. Excluding a non-planar graph , 2003, J. Comb. Theory, Ser. B.

[25]  Paul D. Seymour,et al.  Graph Minors. XIX. Well-quasi-ordering on a surface , 2004, J. Comb. Theory, Ser. B.

[26]  László Babai,et al.  Automorphism groups of graphs and edge-contraction , 1974, Discret. Math..

[27]  Paul D. Seymour.  Disjoint paths in graphs , 2006, Discret. Math..