Graph minors. XX: Wagner's conjecture (Q705888)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Graph minors. XX: Wagner's conjecture |
scientific article; zbMATH DE number 2134346
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Graph minors. XX: Wagner's conjecture |
scientific article; zbMATH DE number 2134346 |
Statements
Graph minors. XX: Wagner's conjecture (English)
0 references
16 February 2005
0 references
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.
0 references
graph
0 references
minor
0 references
surface embedding
0 references
well-quasi-ordering
0 references
