请输入您要查询的字词:

 

单词 Robertson-Seymour Theorem
释义

Robertson-Seymour Theorem

A 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 , there is a finitelist of graphs with the property that a graph embeds on a surface of genus Iff it does not contain,as a minor, any of the graphs on the list .


References

Fellows, M. R. ``The Robertson-Seymour Theorems: A Survey of Applications.'' Comtemp. Math. 89, 1-18, 1987.


随便看

 

数学辞典收录了8975条数学词条,基本涵盖了常用数学知识及数学英语单词词组的翻译及用法,是数学学习的有利工具。

 

Copyright © 2000-2023 Newdu.com.com All Rights Reserved
更新时间:2025/2/22 16:28:57