✦ LIBER ✦

Lower bounds for some Ramsey numbers

✍ Scribed by H.L Abbott; E.R Williams

Publisher: Elsevier Science
Year: 1974
Tongue: English
Weight: 145 KB
Volume: 16
Category: Article
ISSN: 0097-3165
DOI: 10.1016/0097-3165(74)90067-3

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

✍ H.L. Abbott 📂 Article 📅 1972 🏛 Elsevier Science 🌐 English ⚖ 385 KB

Lower bounds for lower Ramsey numbers

✍ Ralph Faudree; Ronald J. Gould; Michael S. Jacobson; Linda Lesniak 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 310 KB 👁 1 views

## Abstract For any graph __G__, let __i__(__G__) and μ;(__G__) denote the smallest number of vertices in a maximal independent set and maximal clique, respectively. For positive integers __m__ and __n__, the lower Ramsey number __s__(__m, n__) is the largest integer __p__ so that every graph of or

New lower bounds of some diagonal Ramsey

New lower bounds of some diagonal Ramsey numbers

✍ Filip Guldan; Pavel Tomasta 📂 Article 📅 1983 🏛 John Wiley and Sons 🌐 English ⚖ 122 KB 👁 1 views

A new construction of self-complementary graphs containing no Klo or K , is described. This construction gives the Ramsey number lower bounds r(10,lO) 2 458 and r(1 1,l 1 ) 2 542. The problem of determining the Ramsey numbers is known to be very difficult and so we are often satisfied with partial

Lower bounds for small diagonal ramsey n

Lower bounds for small diagonal ramsey numbers

✍ James B Shearer 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 129 KB

New Upper and Lower Bounds for Ramsey Nu

New Upper and Lower Bounds for Ramsey Numbers

✍ Huang Yi Ru; Yang Jian Sheng 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 76 KB

Lower bounds for bi-colored quaternary r

Lower bounds for bi-colored quaternary ramsey numbers

✍ Aditya Shastri 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 180 KB

In this note, we prove that R(5, 5; 4) 2 19. We also compute lower bounds for some higher order numbers.