graph minor theorem
This theorem is often referred to as the deepest result in graph theory. It was proven by Robertson and Seymour in 1988 as the culminating result of a long series of articles, and the proof was recently published in the Journal of Combinatorial Theory series B. It resolves Wagner’s conjecture in the affirmative and leads to an important generalization of Kuratowski’s theorem.
Specifically, to every set of finite graphs which is closed under taking minors (meaning if and is isomorphic to a minor of , then ) there exist finitely many graphs such that consists precisely of those finite graphs that do not have a minor isomorphic to one of the . The graphs are often referred to as the forbidden minors for the class .
Neil Robertson and P.D. Seymour. Graph Minors XX: Wagner’s conjecture. Journal of Combinatorial Theory B, Volume 92, Issue 2, November 2004, Pages 325-357. \urlhttp://dx.doi.org/10.1016/j.jctb.2004.08.001
|Title||graph minor theorem|
|Date of creation||2013-03-22 14:04:20|
|Last modified on||2013-03-22 14:04:20|
|Last modified by||AxelBoldt (56)|