Another generalization of the kruskal—katona theorem
✍ Scribed by G.F Clements
- Publisher
- Elsevier Science
- Year
- 1994
- Tongue
- English
- Weight
- 298 KB
- Volume
- 68
- Category
- Article
- ISSN
- 0097-3165
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
An extension of the Kruskal-Katona theorem to colored hypergraphs was given by Frankl, Fiiredi and Kalai in [Shadows of colored complexes, Mathematics Scandinavica]. Here we give a new simple proof.
We present an analog of the well-known Kruskal-Katona theorem for the poset of subspaces of PG(n, 2) ordered by inclusion. For given k, (k < ) and m the problem is to find a family of size m in the set of -subspaces of PG(n, 2), containing the minimal number of k-subspaces. We introduce two lexicogr
We give a very short proof for the Kruskal-Katona theorem and Lovhsz's version of it: given (~) k-element sets there are at least (k~\_l) (k -1)-element sets which are contained in at least one of the k-sets.