Robertson-Seymour theorem
Proper noun
Meaning
the Robertson-Seymour theorem
(graph theory) A theorem stating that the undirected graphs, partially ordered by the graph-minor relationship, form a well-quasi-ordering.
Proper noun
the Robertson-Seymour theorem
(graph theory) A theorem stating that the undirected graphs, partially ordered by the graph-minor relationship, form a well-quasi-ordering.