可数n自由序集的交替托马斯猜想的证明

Order Pub Date : 2023-11-20 DOI:10.1007/s11083-023-09650-w

Davoud Abdi

{"title":"可数n自由序集的交替托马斯猜想的证明","authors":"Davoud Abdi","doi":"10.1007/s11083-023-09650-w","DOIUrl":null,"url":null,"abstract":"An N-free poset is a poset whose comparability graph does not embed an induced path with four vertices. We use the well-quasi-order property of the class of countable N-free posets and some labelled ordered trees to show that a countable N-free poset has one or infinitely many siblings, up to isomorphism. This, partially proves a conjecture stated by Thomassé for this class.","PeriodicalId":501237,"journal":{"name":"Order","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2023-11-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A Proof of the Alternate Thomassé Conjecture for Countable N-Free Posets\",\"authors\":\"Davoud Abdi\",\"doi\":\"10.1007/s11083-023-09650-w\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"An N-free poset is a poset whose comparability graph does not embed an induced path with four vertices. We use the well-quasi-order property of the class of countable N-free posets and some labelled ordered trees to show that a countable N-free poset has one or infinitely many siblings, up to isomorphism. This, partially proves a conjecture stated by Thomassé for this class.\",\"PeriodicalId\":501237,\"journal\":{\"name\":\"Order\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2023-11-20\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Order\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1007/s11083-023-09650-w\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Order","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1007/s11083-023-09650-w","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

无n偏序集是指其可比性图不嵌入具有四个顶点的诱导路径的偏序集。利用可数无n序集和一些标记有序树的拟良序性质，证明了一个可数无n序集有一个或无穷多个兄弟，直至同构。这部分地证明了托马斯为这门课提出的一个猜想。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

A Proof of the Alternate Thomassé Conjecture for Countable N-Free Posets

An N-free poset is a poset whose comparability graph does not embed an induced path with four vertices. We use the well-quasi-order property of the class of countable N-free posets and some labelled ordered trees to show that a countable N-free poset has one or infinitely many siblings, up to isomorphism. This, partially proves a conjecture stated by Thomassé for this class.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Order

自引率

0.00%

发文量