✦ LIBER ✦

On Some Three-Color Ramsey Numbers

✍ Scribed by Wai Chee Shiu; Peter Che Bor Lam; Yusheng Li

Publisher: Springer Japan
Year: 2003
Tongue: English
Weight: 117 KB
Volume: 19
Category: Article
ISSN: 0911-0119
DOI: 10.1007/s00373-002-0495-7

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Three-Color Ramsey Numbers For Paths

✍ András Gyárfás; Miklós Ruszinkó*; Gábor N. Sárközy†; Endre Szemerédi 📂 Article 📅 2007 🏛 Springer-Verlag 🌐 English ⚖ 450 KB

Three-color Ramsey numbers for paths

✍ András Gyárfás; Miklós Ruszinkó; Gábor N. Sárközy; Endre Szemerédi 📂 Article 📅 2008 🏛 Springer-Verlag 🌐 English ⚖ 325 KB

Three color Ramsey number of K4 − e

✍ Geoffrey Exoo 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 300 KB

Exoo, G., Three color Ramsey number of K, -e, Discrete Mathematics 89 (1991) 301-305. We show that 28 s r(K4 -e; 3) G 32. The construction used to establish the lower bound is made by using the strongly regular Schllfli graph for one of the colors, and then by partitioning its complement into two i

Some small ramsey numbers

✍ M. Clancy 📂 Article 📅 1977 🏛 John Wiley and Sons 🌐 English ⚖ 82 KB

## Abstract In previous work, the Ramsey numbers have been evaluated for all pairs of graphs with at most four points. In the present note, Ramsey numbers are tabulated for pairs __F__~1~, __F__~2~ of graphs where __F__~1~ has at most four points and __F__~2~ has exactly five points. Exact results

Some connected ramsey numbers

✍ R. J. Faudree; R. H. Schelp 📂 Article 📅 1978 🏛 John Wiley and Sons 🌐 English ⚖ 489 KB

## Abstract A graph __G__ is co‐connected if both __G__ and its complement __Ḡ__ are connected and nontrivial. For two graphs __A__ and __B__, the connected Ramsey number __r__~c~(__A, B__) is the smallest integer __n__ such that there exists a co‐connected graph of order __n__, and if __G__ is a c

Ramsey numbers for local colorings

✍ A. Gyárfás; J. Lehel; R. H. Schelp; ZS. Tuza 📂 Article 📅 1987 🏛 Springer Japan 🌐 English ⚖ 759 KB