Hello, you have come here looking for the meaning of the word
Robertson-Seymour theorem. In DICTIOUS you will not only get to know all the dictionary meanings for the word
Robertson-Seymour theorem, but we will also tell you about its etymology, its characteristics and you will know how to say
Robertson-Seymour theorem in singular and plural. Everything you need to know about the word
Robertson-Seymour theorem you have here. The definition of the word
Robertson-Seymour theorem will help you to be more precise and correct when speaking or writing your texts. Knowing the definition of
Robertson-Seymour theorem, as well as those of other words, enriches your vocabulary and provides you with more and better linguistic resources.
English
Etymology
Named after mathematicians Neil Robertson and Paul D. Seymour, who proved it in a series of papers from 1983 to 2004.
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.