Enumeration of intersecting families (Q787169)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Enumeration of intersecting families |
scientific article |
Statements
Enumeration of intersecting families (English)
0 references
1984
0 references
If \(n=[n/2]\) then the base 2 logarithm of the number of maximal intersecting families on \(m\) elements is asymptotically \(\left(\frac{m-1}{n-1}\right)\). The upper bound is deduced from an estimate by Kleitman-Markowsky on the number of Sperner systems.
0 references
Boolean functions
0 references
maximal intersecting families
0 references
number of Sperner systems
0 references
