Robertson-Seymour theorem

短语

词形变化

the Robertson-Seymour theorem

释义与例句

name
  1. 1.

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

    数学

词源

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

来源：wiktionary