In this note we give a short proof of a theorem of Milner concerning intersecting Sperner systems. ## 1999 Academic Press An intersecting Sperner system on [n]=[1, ..., n] is a collection of subsets of [n], no pair of which is either disjoint or nested. Milner [2] proved that an intersecting Sperner
β¦ LIBER β¦
A Simple Proof of a Theorem of Milner
β Scribed by Gyula O.H. Katona
- Publisher
- Elsevier Science
- Year
- 1998
- Tongue
- English
- Weight
- 174 KB
- Volume
- 83
- Category
- Article
- ISSN
- 0097-3165
No coin nor oath required. For personal study only.
β¦ Synopsis
Dedicated to the memory of Eric C. Milner
A new short proof is given for the following theorem of Milner: An intersecting, inclusion-free family of subsets of an n-element set has at most ( n W(n+1)Γ2X ) members.
π SIMILAR VOLUMES
Another Simple Proof of a Theorem of Mil
β
A.D Scott
π
Article
π
1999
π
Elsevier Science
π
English
β 74 KB
A simple proof of Moser's theorem
β
Zhu, Xuding
π
Article
π
1999
π
John Wiley and Sons
π
English
β 243 KB
π 2 views
This article gives a simple proof of a result of Moser, which says that, for any rational number r between 2 and 3, there exists a planar graph G whose circular chromatic number is equal to r.
A simple proof of Menger's theorem
β
William McCuaig
π
Article
π
1984
π
John Wiley and Sons
π
English
β 111 KB
π 1 views
## Abstract A proof of Menger's theorem is presented.
A simple proof of lax-nirenberg theorems
β
RΓ©mi Vaillancourt
π
Article
π
1970
π
John Wiley and Sons
π
English
β 359 KB
π 1 views
A simple proof for renewal theorems
β
William Feller
π
Article
π
1961
π
John Wiley and Sons
π
English
β 401 KB
π 1 views
A simple proof of the Brouwer Fixed Poin
β
Konrad GrΓΆger
π
Article
π
1981
π
John Wiley and Sons
π
English
β 107 KB
π 1 views