✦ 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
DOI: 10.1016/0012-365x(90)90168-h

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Upper bounds on the edge clique cover nu

Upper bounds on the edge clique cover number of a graph

✍ Robert C. Brigham; Ronald D. Dutton 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 521 KB

A simple lower bound for monotone clique

A simple lower bound for monotone clique using a communication game

✍ Mikael Goldmann; Johan Håstad 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 436 KB

On the calculation of lower bounds: Some

On the calculation of lower bounds: Some numerical illustrations on a simple example

✍ Sven Larsson 📂 Article 📅 1967 🏛 Elsevier Science 🌐 English ⚖ 629 KB

A lower-bound solution to the collapse o

A lower-bound solution to the collapse of uniform rectangular grids on simple supports

✍ M. Grigorian 📂 Article 📅 1971 🏛 Elsevier Science 🌐 English ⚖ 309 KB

A lower bound on the size of a complex g

A lower bound on the size of a complex generated by an antichain

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

Comment on: A lower-bound solution to th

Comment on: A lower-bound solution to the collapse of uniform rectangular grids on simple supports: M. Grigorian, Int. J. mech. Sci.13, 755 (1971)

✍ K. Rajagopalan 📂 Article 📅 1972 🏛 Elsevier Science 🌐 English ⚖ 116 KB