首页 | 本学科首页   官方微博 | 高级检索  
     检索      


On Better-Quasi-Ordering Countable Series-Parallel Orders
Authors:Sté  phan Thomassé  
Institution:Laboratoire LMD, UFR de Mathématiques, Université Claude Bernard 43, Boulevard du 11 novembre 1918, 69622 Villeurbanne Cedex, France
Abstract:We prove that any infinite sequence of countable series-parallel orders contains an increasing (with respect to embedding) infinite subsequence. This result generalizes Laver's and Corominas' theorems concerning better-quasi-order of the classes of countable chains and trees.

Keywords:Better-quasi-order  interval  series-parallel graphs  series-parallel orders  structured trees  well-quasi-order
点击此处可从《Transactions of the American Mathematical Society》浏览原始摘要信息
点击此处可从《Transactions of the American Mathematical Society》下载免费的PDF全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号