加载中…
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 (1992) 245–253) in this case.

生成讲解博客的中文版本

生成AI智能校验的中文版本