Infinitely many trees have non-Sperner subtree poset (Q2464644)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5220704
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Infinitely many trees have non-Sperner subtree poset |
scientific article; zbMATH DE number 5220704 |
Statements
Infinitely many trees have non-Sperner subtree poset (English)
0 references
17 December 2007
0 references
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.
0 references
poset
0 references
lattice
0 references
Sperner property
0 references
subtree
0 references
0.7912947535514832
0 references
0.7309908866882324
0 references
0.7042726874351501
0 references
0.7031888365745544
0 references
0.6996541619300842
0 references
