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
Another simple proof of Kirchberger's theorem
โ Scribed by R.J Webster
- Publisher
- Elsevier Science
- Year
- 1983
- Tongue
- English
- Weight
- 102 KB
- Volume
- 92
- Category
- Article
- ISSN
- 0022-247X
No coin nor oath required. For personal study only.
๐ 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.