## 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.
Another Simple Proof of a Theorem of Milner
โ Scribed by A.D Scott
- Publisher
- Elsevier Science
- Year
- 1999
- Tongue
- English
- Weight
- 74 KB
- Volume
- 87
- Category
- Article
- ISSN
- 0097-3165
No coin nor oath required. For personal study only.
โฆ Synopsis
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 system on [n] has at most \ n W(n+1)ร2X+ sets. Katona [1] gave a simple proof of Milner's theorem using the cycle method. We give a simpler proof that uses the cycle method in a different way.
We write [n] (k) for the set of subsets of size k of
By a simple counting argument, if knร2 then | & F| |F|.
๐ SIMILAR VOLUMES
In this article, G is a permutation group on a finite set . We write permutations on the right, so that ฮฑg is the image of ฮฑ โ by the action of g โ G. A subset S of is said to be G-regular if the stabilizer g โ G Sg = S is the identity. Our purpose is to give a direct short proof of the following t
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.
## Abstract A proof of Menger's theorem is presented.
DEDICATED TO PROFESSORS EIICHI BANNAI AND ETSUKO BANNAI J. A. Green proved a theorem which is the converse of a theorem of R. Brauer ลฝ . 1955, Proc. Camb. Philos. Soc. 51, 237แ239 . The present author gave another proof of the theorem by making an application of the characteristic class functions of