Name
Abstract | ||
|---|---|---|
We show that the average size of subsets of [n] forming an intersecting Sperner family of cardinality not less than (n-1k-1) is at least k provided that k ≤ n/2 - √n/2 + 1. The statement is not true if n/2 ≥ k n/2 - √8n+1/8+9/8. |
Year | DOI | Venue |
|---|---|---|
2002 | 10.1016/S0012-365X(02)00429-6 | Discrete Mathematics |
Keywords | Field | DocType |
intersecting sperner family,k n,average size,sperner family,intersecting antichain,kleitman–milner theorem | Discrete mathematics,Antichain,Combinatorics,Finite set,Cardinal number,Automated theorem proving,Cardinality,Sperner family,Mathematics | Journal |
Volume | Issue | ISSN |
257 | 2-3 | Discrete Mathematics |
Citations | PageRank | References |
1 | 0.48 | 5 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Christian Bey | 1 | 1 | 1.16 |
| Konrad Engel | 2 | 1 | 1.50 |
| Gyula O. H. Katona | 3 | 264 | 66.44 |
| Uwe Leck | 4 | 112 | 15.38 |