Robertson-Seymour theorem

专有名词

英文释义

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

词形变化

the Robertson-Seymour theorem canonical

词源

Named after mathematicians Neil Robertson and Paul D. Seymour, who proved it in a series of papers from 1983 to 2004.
0 次浏览 数据来源: Wiktionary