On a conjecture about enumerating (2+2)-free posets
classification
🧮 math.CO
keywords
conjecturenumberelementsfreeposetscombinatorialconcerningenumerating
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.