Translate:
English
Chinese (S)
Chinese (T)
Croatian
Dutch
French
German
Hebrew
Italian
Japanese
Korean
Portuguese
Russian
Serbian
Spanish
Swedish
Turkish
Additional
Robertson–Seymour theorem
English Wikipedia - The Free Encyclopedia
Download this dictionary
Robertson–Seymour theorem
In
graph theory
, the
Robertson–Seymour theorem
(also called the
graph minor theorem
) states that the
undirected graphs
,
partially ordered
by the
graph minor
relationship, form a
well-quasi-ordering
. Equivalently, every family of graphs that is closed under minors can be defined by a finite set of
forbidden minors
, in the same way that
Wagner's theorem
characterizes the
planar graphs
as being the graphs that do not have the
complete graph
K
5
and the
complete bipartite graph
K
3,3
as minors.
See more at Wikipedia.org...
© This article uses material from
Wikipedia
®
and is licensed under the
GNU Free Documentation License
and under the
Creative Commons Attribution-ShareAlike License