Infinitely many trees have non-Sperner subtree poset (Q2464644): Difference between revisions

A ranked partially order set (poset) is called Sperner if some maximum antichain consists of elements from a single rank. The set \(C(T)\) of subtrees of a tree \(T\) is a poset with respect to the inclusion ordering, the rank of a subtree being the cardinality of its vertex set. In this paper the authors show that there exists an infinite family of trees \(T\) such that \(C(T)\) is not Sperner.