On a conjecture about enumerating $(2+2)$ -free posets

preprint2010arXivOpen access

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.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Write a reviewWrite

No reviews yet.

Add a commentWrite

No comments yet.

On a conjecture about enumerating $(2+2)$ -free posets

Abstract

Connections

Building this map preview

Reviews 0

Discussion 0

On a conjecture about enumerating (2+2)(2+2)(2+2)-free posets

Abstract

Connections

Building this map preview

Reviews 0

Discussion 0

On a conjecture about enumerating $(2+2)$ -free posets