𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A simple lower bound on edge coverings by cliques

✍ Scribed by A. Gyárfás


Publisher
Elsevier Science
Year
1990
Tongue
English
Weight
114 KB
Volume
85
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.


📜 SIMILAR VOLUMES


A lower bound on the size of a complex g
✍ P. Frankl 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 427 KB

A short proof of the following result of Kleitman is given: the total number of sets contained in some member of an antichain of size (i) over the n-set is at least (E) + l --+ (i) for 0 < k G in. An equally short proof of Harper's isoperimetric theorem is provided as well.