𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Extrinsic upper bounds for λ1

✍ Scribed by Ernst Heintze


Publisher
Springer
Year
1988
Tongue
English
Weight
630 KB
Volume
280
Category
Article
ISSN
0025-5831

No coin nor oath required. For personal study only.


📜 SIMILAR VOLUMES


Upper bounds for harmonious colorings
✍ Colin McDiarmid; Luo Xinhua 📂 Article 📅 1991 🏛 John Wiley and Sons 🌐 English ⚖ 301 KB

## Abstract A harmonious coloring of a simple graph __G__ is a coloring of the vertices such that adjacent vertices receive distinct colors and each pair of colors appears together on at most one edge. The harmonious chromatic number __h__(__G__) is the least number of colors in such a coloring. We

Upper Bounds for Turán Numbers
✍ Alexander Sidorenko 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 549 KB

A system of r-element subsets (blocks) of an n-element set X n is called a Tura n (n, k, r)-system if every k-element subset of X n contains at least one of the blocks. The Tura n number T(n, k, r) is the minimum size of such a system. We prove upper estimates: + as n Ä , r Ä , k=(#+o(1))r, #>1.