English Explanatory Dictionary

Robertson-Seymour theorem

English dictionary entry

Meanings

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

Word forms

Robertson-Seymour theorem the Robertson-Seymour theorem

Etymology

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

This entry uses open data from Wiktionary (CC BY-SA/GFDL). Word forms are used for search and are not indexed as separate pages.
Back to search All on R Russian dictionary Dahl dictionary