Robertson–Seymour theorem

The Petersen family, the obstruction set for linkless embedding.

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₅ and the complete bipartite graph K_3,3 as minors.

单词	Obstruction set
释义	Obstruction set 英语百科 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₅ and the complete bipartite graph K_3,3 as minors.
随便看	vascularized adrenal transplantation vascularized autograft vascularized bone graft vascularized fibular graft vascularized flap vascularized iliac crest graft vascularized parathyroid transplantation vascularized rib graft vascularized transplantation vascular keratitis vascular kinesioneurosis vascular laboratory Vascular lacuna of iliac fascia vascular lake vascular lamina vascular lamina of choroid vascular lamina of stomach vascular layer vascular leak syndrome Vascular leiomyoma Vascular Leiomyomas Vascular Lenticulostriate Disease Vascular Lenticulostriate Diseases vascular lesion Vascular lesion of cord

Obstruction set

Robertson–Seymour theorem