High Quality Content by WIKIPEDIA articles! 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 K5 and the complete bipartite graph K3,3 as minors.

Данное издание не является оригинальным. Книга печатается по технологии принт-он-деманд после получения заказа.