✦ LIBER ✦

Lower bounds for bi-colored quaternary ramsey numbers

✍ Scribed by Aditya Shastri

Publisher: Elsevier Science
Year: 1990
Tongue: English
Weight: 180 KB
Volume: 84
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(90)90379-v

No coin nor oath required. For personal study only.

✦ Synopsis

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

📜 SIMILAR VOLUMES

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

Lower bounds for some Ramsey numbers

✍ H.L. Abbott 📂 Article 📅 1972 🏛 Elsevier Science 🌐 English ⚖ 385 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

Tidier Examples for Lower Bounds on Diag

Tidier Examples for Lower Bounds on Diagonal Ramsey Numbers

✍ Colin McDiarmid; Angelika Steger 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 266 KB

There is a family (H k ) of graphs such that H k has order (1+o(1))(-2Âe) k 2 kÂ2 but has no clique or stable set of order k. This result of Spencer provides the best known lower bound for the diagonal Ramsey numbers R(k, k). Here we see that the graphs H k can be taken to be regular, self-complemen

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

New Lower Bounds for Ramsey Numbers of G

New Lower Bounds for Ramsey Numbers of Graphs and Hypergraphs

✍ Felix Lazebnik; Dhruv Mubayi 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 146 KB 👁 1 views

## dedicated to the memory of rodica simion Let G be an r-uniform hypergraph. The multicolor Ramsey number r k G is the minimum n such that every k-coloring of the edges of the complete r-uniform hypergraph K r n yields a monochromatic copy of G. Improving slightly upon results from M. Axenovich,