×

zbMATH — the first resource for mathematics

Wagner’s conjecture and the graph-minor project. (Wagners Vermutung und das Graphen-Minoren Projekt.) (German) Zbl 1018.05097
This note presents the author’s lecture intending to give to non-specialists insight into the ideas behind Robertson and Seymour’s proof of Wagner’s graph-minor conjecture, which claims that for any infinite sequence of finite graphs \(G_1,G_2,\dots\) there are indices \(i<j\) such that \(G_i\) is a minor of \(G_j\). The proof has been given in a series of papers.
MSC:
05C83 Graph minors
05C10 Planar graphs; geometric and topological aspects of graph theory
05C75 Structural characterization of families of graphs
PDF BibTeX XML Cite