On a conjecture about enumerating (2+2)-free posets
Abstract
Recently, Kitaev and Remmel posed a conjecture concerning the generating function for the number of unlabeled (2+2)-free posets with respect to number of elements and number of minimal elements. In this paper, we present a combinatorial proof of this conjecture.
0
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.