The Aharoni--Korman conjecture for N-free posets with no infinite antichain
Abstract
We give a necessary and sufficient condition for a P4-free graph to be a cograph. This allows us to obtain a simple proof of the fact that finite P4-free graphs are finite cographs. We also prove that N-free chain complete posets and N-free posets with no infinite antichains are series-parallel. As a consequence, we obtain that every N-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 9 (1992) 245--253) in this case.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.