Statements (21)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
|
| gptkbp:alsoKnownAs |
gptkb:graph_minor_theorem
|
| gptkbp:consequence |
Kuratowski's theorem is a special case
Wagner's theorem is a special case |
| gptkbp:field |
graph theory
|
| https://www.w3.org/2000/01/rdf-schema#label |
Robertson–Seymour theorem
|
| gptkbp:implies |
minor-closed graph families can be characterized by a finite set of forbidden minors
|
| gptkbp:namedAfter |
gptkb:Neil_Robertson
gptkb:Paul_Seymour |
| gptkbp:partOf |
graph minor theory
|
| gptkbp:provenBy |
gptkb:Neil_Robertson
gptkb:Paul_Seymour |
| gptkbp:publicationYear |
2004
|
| gptkbp:publishedIn |
gptkb:Annals_of_Mathematics
|
| gptkbp:relatedConcept |
gptkb:well-quasi-ordering
graph minor forbidden minor characterization |
| gptkbp:sentence |
In any infinite sequence of finite undirected graphs, one graph is isomorphic to a minor of another.
|
| gptkbp:bfsParent |
gptkb:structural_graph_theory
gptkb:Robin_Thomas |
| gptkbp:bfsLayer |
6
|