𝔖 Bobbio Scriptorium
✦   LIBER   ✦

An upper bound on the Ramsey number of trees

✍ Scribed by András Gyárfás; Zsolt Tuza

Publisher
Elsevier Science
Year
1987
Tongue
English
Weight
66 KB
Volume
66
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An upper bound for some ramsey numbers
An upper bound for some ramsey numbers
✍ Andrew Thomason 📂 Article 📅 1988 🏛 John Wiley and Sons 🌐 English ⚖ 307 KB 👁 1 views

New upper bounds for the ramsey numbers r ( k , I ) are obtained. In particular it is shown there is a constant A such that The ramsey number r(k, l ) is the smallest integer n, such that any coloring with red and blue of the edges of the complete graph K , of order n yields either a red K , subgra

A note on upper bounds for some Ramsey n
A note on upper bounds for some Ramsey numbers
✍ Chiê Nara; Shun-ichi Tachibana 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 345 KB

We show that r(3, n) C(Z) -5 for n 2 13, and r(4, n)So(l') -1 for n 3 12.

An upper bound for the Ramsey numbers r(
An upper bound for the Ramsey numbers r(K3,G)
✍ Wayne Goddard; Daniel J. Kleitman 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 372 KB

The Ramsey number r(H, G) is defined as the minimum N such that for any coloring of the edges of the N-vertex complete graph KN in red and blue, it must contain either a ted H or a blue G. In this paper we show that for any graph G without isolated vertices, r(K,, G)< 2qf 1 where G has q edges. In o