This is an old revision of this page, as edited by SineBot(talk | contribs) at 18:50, 14 October 2009(Signing comment by Luis Goddyn - "Justification of the change of "Robertson-Seymour Theorem" into "Graph Structure Theorem""). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.Revision as of 18:50, 14 October 2009 by SineBot(talk | contribs)(Signing comment by Luis Goddyn - "Justification of the change of "Robertson-Seymour Theorem" into "Graph Structure Theorem"")
This article is within the scope of WikiProject Mathematics, a collaborative effort to improve the coverage of mathematics on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.MathematicsWikipedia:WikiProject MathematicsTemplate:WikiProject Mathematicsmathematics
Changed "Robertson-Seymour Theorem" into "Graph Structure Theorem" in the section "General Theorems" of the main table.
This is more correct, as the Graph Structure Theorem does give a rough description of a class of graphs characterized by forbidden minors.
The so-called "Robertson-Seymour Theorem" as defined on wikipedia is the statement that there are no infinite antichains in the minor relation. It says nothing about the structure of graphs avoiding one or more forbidden minors. —Preceding unsigned comment added by Luis Goddyn (talk • contribs) 18:49, 14 October 2009 (UTC)[reply]
