✦ LIBER ✦

A lower bound for irredundant Ramsey numbers

✍ Scribed by Michael Krivelevich

Publisher: Elsevier Science
Year: 1998
Tongue: English
Weight: 348 KB
Volume: 183
Category: Article
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(97)00055-1

No coin nor oath required. For personal study only.

✦ Synopsis

Given a graph G-(V,E), a vertex subset U C V is called irredundant if every vertex v E U either has no neighbours in U or there exists a vertex w E V\U such that v is the only neighbour of w in U. The irredundant Ramsey number s(m,n) is the smallest N such that any redblue edge colouring of K N yields either an m-element irredundant subset in the blue graph or an n-element irredundant subset in the red graph. Using probabilistic methods we show that

📜 SIMILAR VOLUMES

Irredundant ramsey numbers for graphs

✍ R. C. Brewster; E. J. Cockayne; C. M. Mynhardt 📂 Article 📅 1989 🏛 John Wiley and Sons 🌐 English ⚖ 356 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

Asymptotic bounds for irredundant and mi

Asymptotic bounds for irredundant and mixed Ramsey numbers

✍ Guantao Chen; Johannes H. Hattingh; Cecil C. Rousseau 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 473 KB 👁 1 views

## Abstract The irredundant Ramsey number __s(m, n)__ is the smallest __N__ such that in every red‐blue coloring of the edges of __K__~__N__~, either the blue graph contains an __m__‐element irredundant set or the red graph contains an __n__‐element irredundant set. The definition of the mixed Rams

CO-irredundant Ramsey numbers for graphs

✍ E. J. Cockayne; G. MacGillivray; J. Simmons 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 120 KB 👁 2 views

On irredundant Ramsey numbers for graphs

✍ Johannes H. Hattingh 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 248 KB

## Abstract The irredundant Ramsey number __s(m, n)__ is the smallest p such that in every two‐coloring of the edges of __K~p~__ using colors red (__R__) and blue (__B__), either the blue graph contains an __m__‐element irredundant set or the red graph contains an __n__‐element irredundant set. We

Lower bounds for some Ramsey numbers

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