Enumeration of intersecting families (Q787169)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Enumeration of intersecting families |
scientific article; zbMATH DE number 3840001
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Enumeration of intersecting families |
scientific article; zbMATH DE number 3840001 |
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
0.9436225
0 references
0.9332682
0 references
0.9315747
0 references
0 references
0 references
0 references
0 references
0.9039135
0 references
0.9013654
0 references
