Wagner's conjecture and the graph-minor project (Q1861446)
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: Wagner's conjecture and the graph-minor project |
scientific article; zbMATH DE number 1877284
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Wagner's conjecture and the graph-minor project |
scientific article; zbMATH DE number 1877284 |
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
0.8901946544647217
0 references
0.8446195125579834
0 references
0.8318989872932434
0 references
0.8249664902687073
0 references
