This note describes two lemmas for Ramsey number R(p, q; 4), which help us to deduce lower bounds better than the corresponding results of Shastri (1990). ## 1. Introduction Let S be a set. We denote by S t4) the collection of subsets of S with exactly 4 elements. We call the elements of S t4~ the
✦ LIBER ✦
New lower bounds for the Hadwiger numbers of ℓp balls for p < 2
✍ Scribed by K.J. Swanepoel
- Publisher
- Elsevier Science
- Year
- 1999
- Tongue
- English
- Weight
- 191 KB
- Volume
- 12
- Category
- Article
- ISSN
- 0893-9659
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
New lower bounds for Ramsey number R (p,
✍
Enmin Song; Weiguo Ye; Yanwu Liu
📂
Article
📅
1995
🏛
Elsevier Science
🌐
English
⚖ 168 KB
New Lower Bounds for Ramsey Numbers of G
✍
Felix Lazebnik; Dhruv Mubayi
📂
Article
📅
2002
🏛
Elsevier Science
🌐
English
⚖ 146 KB
👁 1 views
## dedicated to the memory of rodica simion Let G be an r-uniform hypergraph. The multicolor Ramsey number r k G is the minimum n such that every k-coloring of the edges of the complete r-uniform hypergraph K r n yields a monochromatic copy of G. Improving slightly upon results from M. Axenovich,
Lower bound for the number of nodes of c
✍
Yuan Xu
📂
Article
📅
2003
🏛
Elsevier Science
🌐
English
⚖ 170 KB
Lower bounds for the clique and the chro
✍
C.S. Edwards; C.H. Elphick
📂
Article
📅
1983
🏛
Elsevier Science
🌐
English
⚖ 687 KB
Isoperimetric constants and some lower b
✍
Albert Avinyo
📂
Article
📅
1997
🏛
Elsevier Science
🌐
English
⚖ 285 KB
A lower bound for the number of periodic
✍
Antti J. Niemi
📂
Article
📅
1995
🏛
Elsevier Science
🌐
English
⚖ 526 KB