Yet another generalization of the Kruskal-Katona theorem
โ Scribed by G.F. Clements
- Publisher
- Elsevier Science
- Year
- 1998
- Tongue
- English
- Weight
- 479 KB
- Volume
- 184
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
โฆ Synopsis
The rank r(a) of a is b{ila/= tn}l. For 0 ~<l~<n, the set consisting of all elements of rank l is called the lth rank and is denoted /}. Let b, l and m denote positive integers satisfying b ~ l ~<n and m ~<ITII. For a subset .~ยข of Tt, Ab.~ denotes the elements of Tt-b which precede at least one element of s~ยข. An algorithm is given for calculating min labial, where the minimum is taken over all m-element subsets .~ of ~. If tl = t2 .....
๐ 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.