✦ LIBER ✦

A simple proof of the Kruskal-Katona theorem

✍ Scribed by D.E Daykin

Publisher: Elsevier Science
Year: 1974
Tongue: English
Weight: 91 KB
Volume: 17
Category: Article
ISSN: 0097-3165
DOI: 10.1016/0097-3165(74)90012-0

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A new proof of the colored Kruskal—Katon

A new proof of the colored Kruskal—Katona theorem

✍ Eran London 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 386 KB

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.

A new short proof for the Kruskal-Katona

A new short proof for the Kruskal-Katona theorem

✍ P Frankl 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 96 KB

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.

A generalization of the Kruskal-Katona t

A generalization of the Kruskal-Katona theorem

✍ G.F Clements 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 289 KB

Another generalization of the kruskal—ka

Another generalization of the kruskal—katona theorem

✍ G.F Clements 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 298 KB

A Kruskal–Katona Type Theorem for the Li

A Kruskal–Katona Type Theorem for the Linear Lattice

✍ S Bezrukov; A Blokhuis 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 154 KB

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

A Simple Proof of a Theorem of Milner

✍ Gyula O.H. Katona 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 174 KB

## 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.