Statements (16)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
|
| gptkbp:consequence |
Algorithmic graph theory
Graph structure theory Wagner's conjecture |
| gptkbp:field |
gptkb:mathematics
graph theory |
| gptkbp:implies |
finite forbidden minor characterization for minor-closed graph families
|
| gptkbp:provenBy |
gptkb:Neil_Robertson
gptkb:Paul_Seymour |
| gptkbp:publishedIn |
gptkb:Annals_of_Mathematics
|
| gptkbp:relatedTo |
gptkb:Robertson–Seymour_theorem
|
| gptkbp:state |
Graphs are well-quasi-ordered under the minor relation
|
| gptkbp:yearProved |
2004
|
| gptkbp:bfsParent |
gptkb:Robertson–Seymour_theorem
|
| gptkbp:bfsLayer |
7
|
| https://www.w3.org/2000/01/rdf-schema#label |
graph minor theorem
|