✦ LIBER ✦

Upper bounds for material coefficients

✍ Scribed by E. Ascher

Publisher: Elsevier Science
Year: 1973
Tongue: English
Weight: 77 KB
Volume: 46
Category: Article
ISSN: 0375-9601
DOI: 10.1016/0375-9601(73)90057-1

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Upper bounds for coefficients of linear

Upper bounds for coefficients of linear threshold forms

✍ A. G. Chernyavskii 📂 Article 📅 1978 🏛 Springer US 🌐 English ⚖ 180 KB

On upper bounds of Fourier-Walsh coeffic

On upper bounds of Fourier-Walsh coefficients

✍ A. V. Efimov 📂 Article 📅 1969 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 318 KB

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.

Upper Bounds for Regularized Determinant

Upper Bounds for Regularized Determinants

✍ H. Gillet; C. Soulé 📂 Article 📅 1998 🏛 Springer 🌐 English ⚖ 167 KB

Lower bounds and upper bounds for chroma

Lower bounds and upper bounds for chromatic polynomials

✍ Klaus Dohmen 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 204 KB

## Abstract In this paper we give lower bounds and upper bounds for chromatic polynomials of simple undirected graphs on __n__ vertices having __m__ edges and girth exceeding __g__ © 1993 John Wiley & Sons, Inc.