On a conjecture about enumerating $(2+2)$-free posets
Combinatorics
2010-06-17 v3
Abstract
Recently, Kitaev and Remmel posed a conjecture concerning the generating function for the number of unlabeled -free posets with respect to number of elements and number of minimal elements. In this paper, we present a combinatorial proof of this conjecture.
Cite
@article{arxiv.1006.1226,
title = {On a conjecture about enumerating $(2+2)$-free posets},
author = {Sherry H. F. Yan},
journal= {arXiv preprint arXiv:1006.1226},
year = {2010}
}