Infinitely many trees have non-Sperner subtree poset (Q2464644): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s11083-007-9064-2 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1998498520 / rank | |||
Normal rank | |||
Revision as of 18:56, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Infinitely many trees have non-Sperner subtree poset |
scientific article |
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
