单词 | Robertson-Seymour Theorem |
释义 | Robertson-Seymour TheoremA generalization of the Kuratowski Reduction Theorem by Robertson and Seymour, which states that the collection offinite graphs is well-quasi-ordered by minor embeddability, from which it follows that Kuratowski's ``forbidden minor''embedding obstruction generalizes to higher genus surfaces. Formally, for a fixed Integer
Fellows, M. R. ``The Robertson-Seymour Theorems: A Survey of Applications.'' Comtemp. Math. 89, 1-18, 1987. |
随便看 |
|
数学辞典收录了8975条数学词条,基本涵盖了常用数学知识及数学英语单词词组的翻译及用法,是数学学习的有利工具。