𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A new proof of the colored Kruskal—Katona theorem

✍ Scribed by Eran London

Publisher
Elsevier Science
Year
1994
Tongue
English
Weight
386 KB
Volume
126
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

✦ Synopsis

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.

📜 SIMILAR VOLUMES

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 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 new proof of the 6 color theorem
A new proof of the 6 color theorem
✍ Oleg V. Borodin 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 579 KB

## Abstract In 1965 Ringel raised a 6 color problem for graphs that can be stated in at least three different forms. In particular, is it possible to color the vertices and faces of every plane graph with 6 colors so that any two adjacent or incident elements are colored differently? This 6 color p