Graph minors. XX: Wagner's conjecture (Q705888): Difference between revisions

This paper is the culmination of a series investigating graph minors. In this work the authors prove Wagner's conjecture: every infinite set of finite graphs contains one graph that is isomorphic to a minor of another. As a corollary: for every class of finite graphs closed under taking minors, there is a finite list of excluded minors characterizing that class. The result is of fundamental importance in graph theory.