Solution of a research problem on trees of subsets (Q1335406)
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 646767
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Solution of a research problem on trees of subsets |
scientific article; zbMATH DE number 646767 |
Statements
Solution of a research problem on trees of subsets (English)
0 references
12 February 1995
0 references
Let \(X\) be an \(n\)-element set and \(\mathcal F\) a \(k\)-element collection of proper, non-empty subsets of \(X\) such that if \(A\), \(B\in {\mathcal F}\) then either \(A\subseteq B\), or \(B\subseteq A\), or they are disjoint. A closed formula is given for the number of those collections and it is shown that \(k\leq 2n-2\).
0 references
trees of subsets
0 references
extremal set theory
0 references
enumeration
0 references
0.9130129814147948
0 references
0.7348868250846863
0 references
0.7340573072433472
0 references
