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

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.

arXiv comment35 pages. arXiv admin note: text overlap with arXiv:2004.12457 by other authors