Meaning of Robertson-Seymour theorem | Babel Free
Definitions
A theorem stating that the undirected graphs, partially ordered by the graph-minor relationship, form a well-quasi-ordering.
CEFR level
B2
Upper Intermediate
This word is part of the CEFR B2 vocabulary — upper intermediate level.
This word is part of the CEFR B2 vocabulary — upper intermediate level.