## Abstract For any graph __G__, let __i__(__G__) and μ;(__G__) denote the smallest number of vertices in a maximal independent set and maximal clique, respectively. For positive integers __m__ and __n__, the lower Ramsey number __s__(__m, n__) is the largest integer __p__ so that every graph of or
✦ LIBER ✦
A Lower Estimate for Entropy Numbers
✍ Scribed by Thomas Kühn
- Publisher
- Elsevier Science
- Year
- 2001
- Tongue
- English
- Weight
- 89 KB
- Volume
- 110
- Category
- Article
- ISSN
- 0021-9045
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
Lower bounds for lower Ramsey numbers
✍
Ralph Faudree; Ronald J. Gould; Michael S. Jacobson; Linda Lesniak
📂
Article
📅
1990
🏛
John Wiley and Sons
🌐
English
⚖ 310 KB
👁 1 views
An Inequality for Trigonometric Polynomi
✍
V.N. Temlyakov
📂
Article
📅
1995
🏛
Elsevier Science
🌐
English
⚖ 425 KB
Estimates of Entropy Numbers and Gaussia
✍
E.S. Belinsky
📂
Article
📅
1998
🏛
Elsevier Science
🌐
English
⚖ 241 KB
The paper contains estimates for the entropy numbers of classes of functions with conditions on the mixed derivative (difference), in the uniform and integral metrics. As an application, the new estimates of the Gaussian measure of a small ball are obtained.
New Upper and Lower Bounds for Ramsey Nu
✍
Huang Yi Ru; Yang Jian Sheng
📂
Article
📅
2001
🏛
Elsevier Science
🌐
English
⚖ 76 KB
Tidier Examples for Lower Bounds on Diag
✍
Colin McDiarmid; Angelika Steger
📂
Article
📅
1996
🏛
Elsevier Science
🌐
English
⚖ 266 KB
There is a family (H k ) of graphs such that H k has order (1+o(1))(-2Âe) k 2 kÂ2 but has no clique or stable set of order k. This result of Spencer provides the best known lower bound for the diagonal Ramsey numbers R(k, k). Here we see that the graphs H k can be taken to be regular, self-complemen
A Lower Bound for the One-Chromatic Numb
✍
V.P. Korzhik
📂
Article
📅
1994
🏛
Elsevier Science
🌐
English
⚖ 487 KB