✦ LIBER ✦

An upper bound for the ramsey number M(5, 4)

✍ Scribed by K Walker

Publisher: Elsevier Science
Year: 1971
Tongue: English
Weight: 498 KB
Volume: 11
Category: Article
ISSN: 0097-3165
DOI: 10.1016/0097-3165(71)90002-1

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

An upper bound for the ramsey number r(K

An upper bound for the ramsey number r(K5 − e)

✍ H. Harborth; I. Mengersen 📂 Article 📅 1985 🏛 John Wiley and Sons 🌐 English ⚖ 151 KB 👁 1 views

An upper bound on the Ramsey number of t

An upper bound on the Ramsey number of trees

✍ András Gyárfás; Zsolt Tuza 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 66 KB

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

An upper bound on the Ramsey numbers R(3

An upper bound on the Ramsey numbers R(3, k)

✍ Jerrold R Griggs 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 372 KB

An improved upper bound for Ramsey numbe

An improved upper bound for Ramsey number N (3, 3, 3, 3; 2)

✍ Adolfo Sanchez-Flores 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 251 KB

The Ramsey number N(3, 3, 3, 3; 2) is the smallest integer n such that each 4-coloring by edges of the complete graph on n vertices contains monochromatic triangles. It is well known that 51 ~< N(3,3,3,3;2) ~< 65. Here we prove that N(3,3,3,3;2) ~< 64.