𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Irredundant ramsey numbers for graphs

✍ Scribed by R. C. Brewster; E. J. Cockayne; C. M. Mynhardt

Publisher
John Wiley and Sons
Year
1989
Tongue
English
Weight
356 KB
Volume
13
Category
Article
ISSN
0364-9024

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

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

The irredundant ramsey number s(3, 7)
The irredundant ramsey number s(3, 7)
✍ Guantao Chen; Cecil C. Rousseau 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 395 KB

## Abstract The irredundant Ramsey number __s__(__m, n__) is the smallest __p__ such that for every graph __G__ with __p__ vertices, either __G__ contains an __n__‐element irredundant set or its complement __G__ contains an __m__‐element irredundant set. Cockayne, Hattingh, and Mynhardt have given

On ramsey-tuŕan numbers for 3-graphs
On ramsey-tuŕan numbers for 3-graphs
✍ A. F. Sidorenko 📂 Article 📅 1992 🏛 John Wiley and Sons 🌐 English ⚖ 255 KB

## Abstract For every __r__‐graph __G__ let π(__G__) be the minimal real number ϵ such that for every ϵ < 0 and __n__ ϵ __n__~0~(λ, __G__) every __R__‐graph __H__ with __n__ vertices and more than (π + ϵ)(nr) edges contains a copy of __G__. The real number λ(__G__) is defined in the same way, addin