Word.ws English Dictionary

Robertson-Seymour theorem

Robertson-Seymour theorem proper noun: 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

  1. A theorem stating that the undirected graphs, partially ordered by the graph-minor relationship, form a well-quasi-ordering.

Origin of Robertson-Seymour theorem

Named after mathematicians Neil Robertson and Paul D. Seymour, who proved it in a series of papers from 1983 to 2004.

Questions about Robertson-Seymour theorem

What does Robertson-Seymour theorem mean?
Robertson-Seymour theorem means a theorem stating that the undirected graphs, partially ordered by the graph-minor relationship, form a well-quasi-ordering.
What part of speech is Robertson-Seymour theorem?
Robertson-Seymour theorem is a proper noun.

Words near Robertson-Seymour theorem in the dictionary

  1. Robertson County
  2. Robertson screw
  3. Robertson screwdriver
  4. Robertson screwdrivers
  5. Robertson screws
  6. Robertson-Seymour theorem
  7. Robertsonian
  8. Robertsonian translocation
  9. Robertsonian translocations
  10. Robertsons Beach
  11. Robertstown

Source and license

Adapted from Wiktionary: Robertson-Seymour theorem (page history and authors). Text available under the Creative Commons Attribution-ShareAlike 4.0 license. Word.ws reformatted the entry and added links. Wiktionary data of 2026-09-02.

Last updated:

Cite this entry: “Robertson-Seymour theorem.” Word.ws, https://word.ws/robertson-seymour_theorem. Based on Wiktionary, CC BY-SA 4.0.