𝔖 Bobbio Scriptorium
✦   LIBER   ✦

ASYMPTOTIC BOUNDS FOR IRREDUNDANT RAMSEY NUMBERS

✍ Scribed by Erdös, Paul; Hattingh, Johannes H.

Book ID
118175301
Publisher
Taylor and Francis Group
Year
1993
Tongue
English
Weight
412 KB
Volume
16
Category
Article
ISSN
1607-3606

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

A lower bound for irredundant Ramsey num
A lower bound for irredundant Ramsey numbers
✍ Michael Krivelevich 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 348 KB

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 yiel

Irredundant ramsey numbers for graphs
Irredundant ramsey numbers for graphs
✍ R. C. Brewster; E. J. Cockayne; C. M. Mynhardt 📂 Article 📅 1989 🏛 John Wiley and Sons 🌐 English ⚖ 356 KB
CO-irredundant Ramsey numbers for graphs
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
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