This article is rated Start-class on Wikipedia's
content assessment scale. It is of interest to the following WikiProjects: | |||||||||||||||||||||||||||||||
|
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)
There is a discussion at math overflow about a potential mistake (or rather unclear formulation) in this article: https://mathoverflow.net/questions/348097/wikipedia-article-on-forbidden-graph-substructures
This article is rated Start-class on Wikipedia's
content assessment scale. It is of interest to the following WikiProjects: | |||||||||||||||||||||||||||||||
|
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)
There is a discussion at math overflow about a potential mistake (or rather unclear formulation) in this article: https://mathoverflow.net/questions/348097/wikipedia-article-on-forbidden-graph-substructures