The Aharoni--Korman conjecture for $N$-free posets with no infinite antichain
Combinatorics
2023-03-06 v2
Abstract
We give a necessary and sufficient condition for a -free graph to be a cograph. This allows us to obtain a simple proof of the fact that finite -free graphs are finite cographs. We also prove that -free chain complete posets and -free posets with no infinite antichains are series-parallel. As a consequence, we obtain that every -free poset with no infinite antichain has a chain and a partition into antichains so that each part intersects the chain. This answers a conjecture of Aharoni and Korman (Order \textbf{9} (1992) 245--253) in this case.
Keywords
Cite
@article{arxiv.1811.07959,
title = {The Aharoni--Korman conjecture for $N$-free posets with no infinite antichain},
author = {Imed Zaguia},
journal= {arXiv preprint arXiv:1811.07959},
year = {2023}
}
Comments
9 pages