Wagner's conjecture and the graph-minor project (Q1861446)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Wagner's conjecture and the graph-minor project |
scientific article |
Statements
Wagner's conjecture and the graph-minor project (English)
0 references
6 March 2003
0 references
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.
0 references
edge contraction
0 references
tree width
0 references
grid graphs
0 references
planar graphs
0 references