A simple proof of a theorem of Milner (Q1268609)
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: A simple proof of a theorem of Milner |
scientific article; zbMATH DE number 1212915
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A simple proof of a theorem of Milner |
scientific article; zbMATH DE number 1212915 |
Statements
A simple proof of a theorem of Milner (English)
0 references
14 January 1999
0 references
This paper presents a simple proof, based on Katona's own cyclic permutation method, of Milner's well-known result that an intersecting Sperner family on an \(n\)-element set has at most \(\binom{n} {\lceil (n+1)/2\rceil}\) members.
0 references
intersecting Sperner family
0 references
cyclic permutation method
0 references
