{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,6]],"date-time":"2026-02-06T23:28:52Z","timestamp":1770420532284,"version":"3.49.0"},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2023,11,20]],"date-time":"2023-11-20T00:00:00Z","timestamp":1700438400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,11,20]],"date-time":"2023-11-20T00:00:00Z","timestamp":1700438400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Order"],"published-print":{"date-parts":[[2024,12]]},"DOI":"10.1007\/s11083-023-09650-w","type":"journal-article","created":{"date-parts":[[2023,11,20]],"date-time":"2023-11-20T13:03:28Z","timestamp":1700485408000},"page":"613-641","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A Proof of the Alternate Thomass\u00e9 Conjecture for Countable N-Free Posets"],"prefix":"10.1007","volume":"41","author":[{"given":"Davoud","family":"Abdi","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,11,20]]},"reference":[{"key":"9650_CR1","unstructured":"Abdi, D.: Siblings of direct sums of chains (2022). https:\/\/arxiv.org\/abs\/2209.03477"},{"key":"9650_CR2","unstructured":"Abdi, D., Laflamme, C., Tateno, A., Woodrow, R.: An example of Tateno disproving conjectures of Bonato-Tardif, Thomass\u00e9, and Tyomkyn (2022). https:\/\/arxiv.org\/abs\/2205.14679"},{"key":"9650_CR3","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1016\/j.jctb.2010.10.004","volume":"101","author":"A Bonato","year":"2011","unstructured":"Bonato, A., Bruhn, H., Diestel, R., Spr\u00fcssel, Ph.: Twins of rayless graphs. J. Combinatorial Theory Ser. B 101, 60\u201365 (2011)","journal-title":"J. Combinatorial Theory Ser. B"},{"key":"9650_CR4","doi-asserted-by":"publisher","first-page":"1743","DOI":"10.1016\/j.disc.2012.01.025","volume":"312","author":"Y Boudabbous","year":"2012","unstructured":"Boudabbous, Y., Delhomm\u00e9, C.: Prechains and self-duality. Discrete Math. 312, 1743\u20131765 (2012)","journal-title":"Discrete Math."},{"key":"9650_CR5","unstructured":"Braunfeld, S., Laskowski, M.C.: Counting siblings in universal theories (2021). arXiv:1910.11230"},{"key":"9650_CR6","doi-asserted-by":"publisher","first-page":"874","DOI":"10.1016\/j.jctb.2006.02.008","volume":"96","author":"A Bonato","year":"2006","unstructured":"Bonato, A., Tardif, C.: Mutually embeddable graphs and the tree alternative conjecture. J. Combin. Theory Ser. B 96, 874\u2013880 (2006)","journal-title":"J. Combin. Theory Ser. B"},{"key":"9650_CR7","first-page":"1","volume":"394","author":"B Courcelle","year":"2008","unstructured":"Courcelle, B., Delhomm\u00e9, Ch.: The modular decomposition of countable graphs. Definitions and construction in monadic second-order logic, Theoretical Computer Science 394, 1\u201338 (2008)","journal-title":"Definitions and construction in monadic second-order logic, Theoretical Computer Science"},{"key":"9650_CR8","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1016\/0166-218X(85)90030-7","volume":"12","author":"M Habib","year":"1985","unstructured":"Habib, M., Jegou, R.: $$N$$-free posets as generalisations of series-parallel posets. Discret. Appl. Math. 12, 279\u2013291 (1985)","journal-title":"Discret. Appl. Math."},{"key":"9650_CR9","unstructured":"Hahn, G., Pouzet, M., Woodrow, R.: Siblings of countable cographs (2020). arXiv:2004.12457"},{"key":"9650_CR10","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/0095-8956(78)90013-8","volume":"24","author":"HA Jung","year":"1978","unstructured":"Jung, H.A.: On a class of posets and the corresponding comparability graphs. Journal of Combinatorial Theory, Series B 24, 125\u2013133 (1978)","journal-title":"Journal of Combinatorial Theory, Series B"},{"key":"9650_CR11","doi-asserted-by":"crossref","unstructured":"Kelly, D.: Comparability graphs, Graphs and Orders. In: Rival, I. (ed.), pp. 3\u201340. D. Reidel Publishing Company (1985)","DOI":"10.1007\/978-94-009-5315-4_1"},{"key":"9650_CR12","doi-asserted-by":"crossref","unstructured":"Laver, R.: On Fra\u00efss\u00e9\u2019s order type conjecture. Ann. Math. 93, 89\u2013111 (1971). MR 43:4731","DOI":"10.2307\/1970754"},{"key":"9650_CR13","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1007\/s12188-016-0169-7","volume":"87","author":"C Laflamme","year":"2017","unstructured":"Laflamme, C., Pouzet, M., Sauer, N.: Invariant subsets of scattered trees and the tree alternative property of Bonato and Tardif. Abh. Math. Semin. Univ. Hambg. 87, 369\u2013408 (2017)","journal-title":"Abh. Math. Semin. Univ. Hambg."},{"issue":"2","key":"9650_CR14","doi-asserted-by":"publisher","first-page":"90","DOI":"10.55016\/ojs\/cdm.v16i2.71727","volume":"16","author":"C Laflamme","year":"2021","unstructured":"Laflamme, C., Pouzet, M., Sauer, N., Woodrow, R.: Siblings of an $$\\aleph _0$$-categorical relational structure. Contrib. Discrete Math. 16(2), 90\u2013127 (2021)","journal-title":"Contrib. Discrete Math."},{"key":"9650_CR15","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/j.disc.2014.07.005","volume":"335","author":"C Laflamme","year":"2014","unstructured":"Laflamme, C., Pouzet, M., Sauer, N., Zaguia, I.: Pairs of orthogonal countable ordinals. Discrete Math. 335, 35\u201344 (2014)","journal-title":"Discrete Math."},{"issue":"7\u20138","key":"9650_CR16","doi-asserted-by":"publisher","first-page":"811","DOI":"10.1007\/s00153-017-0545-8","volume":"56","author":"C Laflamme","year":"2017","unstructured":"Laflamme, C., Pouzet, M., Woodrow, R.: Equimorphy- the case of chains. Arch. Math. Logic 56(7\u20138), 811\u2013829 (2017)","journal-title":"Arch. Math. Logic"},{"key":"9650_CR17","unstructured":"Tateno, A.: Mutually embeddable trees and a counterexample to the Tree Alternative Conjecture, unpublished manuscript, 32 pages, (2008)"},{"key":"9650_CR18","unstructured":"Thomass\u00e9, S.: Conjectures on countable relations, circulating manuscript, 17p. (2000)"},{"issue":"6","key":"9650_CR19","doi-asserted-by":"publisher","first-page":"2491","DOI":"10.1090\/S0002-9947-99-02400-9","volume":"352","author":"S Thomass\u00e9","year":"2000","unstructured":"Thomass\u00e9, S.: On better-quasi-ordering countable series-parallel orders. Trans. Amer. Math. Soc. 352(6), 2491\u20132505 (2000)","journal-title":"Trans. Amer. Math. Soc."},{"key":"9650_CR20","doi-asserted-by":"publisher","first-page":"5963","DOI":"10.1016\/j.disc.2009.04.025","volume":"309","author":"M Tyomkyn","year":"2009","unstructured":"Tyomkyn, M.: A proof of the rooted tree alternative conjecture. Discret. Math. 309, 5963\u20135967 (2009)","journal-title":"Discret. Math."},{"key":"9650_CR21","unstructured":"Tyomkyn, M.: Personal communication (2020)"}],"container-title":["Order"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11083-023-09650-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11083-023-09650-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11083-023-09650-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,9]],"date-time":"2025-01-09T07:09:54Z","timestamp":1736406594000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11083-023-09650-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,11,20]]},"references-count":21,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2024,12]]}},"alternative-id":["9650"],"URL":"https:\/\/doi.org\/10.1007\/s11083-023-09650-w","relation":{},"ISSN":["0167-8094","1572-9273"],"issn-type":[{"value":"0167-8094","type":"print"},{"value":"1572-9273","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,11,20]]},"assertion":[{"value":"6 January 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 October 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 November 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The author has no conflicts of interest to declare that are relevant to the content of this article.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflicts of interest\/Competing interests"}}]}}