๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

New bounds for the distance Ramsey number

โœ Scribed by Kupavskii, Andrey B.; Raigorodskii, Andrei M.; Titova, Maria V.

Book ID
121244241
Publisher
Elsevier Science
Year
2013
Tongue
English
Weight
398 KB
Volume
313
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

New Upper Bounds for Ramsey Numbers
New Upper Bounds for Ramsey Numbers
โœ Y.R Huang; K.M Zhang ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 79 KB

The Ramsey number R(G 1 , G 2 ) is the smallest integer p such that for any graph Some new upper bound formulas are obtained for R(G 1 , G 2 ) and R(m, n), and we derive some new upper bounds for Ramsey numbers here.

New lower bounds for seven classical Ram
New lower bounds for seven classical Ramsey numbers
โœ Kang Wu; Wenlong Su; Haipeng Luo; Xiaodong Xu ๐Ÿ“‚ Article ๐Ÿ“… 2009 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 346 KB

New lower bounds for seven classical Ramsey numbers are obtained by considering some circulant graphs G n (A i ) with n โ‰ฅ 142 whose orders might be either prime or not. The results are

Upper bounds for Ramsey numbers
Upper bounds for Ramsey numbers
โœ Lingsheng Shi ๐Ÿ“‚ Article ๐Ÿ“… 2003 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 207 KB
New lower bounds for Ramsey number R (p,
New lower bounds for Ramsey number R (p, q; 4)
โœ Enmin Song; Weiguo Ye; Yanwu Liu ๐Ÿ“‚ Article ๐Ÿ“… 1995 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 168 KB

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