𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Generalized ramsey theory for graphs VII: Ramsey numbers for multigraphs and networks

✍ Scribed by F. Harary; A. J. Schwenk


Publisher
John Wiley and Sons
Year
1978
Tongue
English
Weight
309 KB
Volume
8
Category
Article
ISSN
0028-3045

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


Generalized Ramsey theory for graphs IV,
✍ F. Harary; G. Prins πŸ“‚ Article πŸ“… 1974 πŸ› John Wiley and Sons 🌐 English βš– 412 KB

A paopm graph G has no isolated points. I t s R m e y r u m b a r ( G ) i s the m i n i m p such that every 2-coloring of the edges of K contains a monochromatic G. The Ramhey m & t @ m y R(G) i s P the r (G) ' With j u s t one exception, namely Kq, we determine R(G) f o r proper graphs u i t h a t

Irredundant ramsey numbers for graphs
✍ R. C. Brewster; E. J. Cockayne; C. M. Mynhardt πŸ“‚ Article πŸ“… 1989 πŸ› John Wiley and Sons 🌐 English βš– 356 KB
Local and meank-Ramsey numbers for compl
✍ Schelp, R. H. πŸ“‚ Article πŸ“… 1997 πŸ› John Wiley and Sons 🌐 English βš– 67 KB πŸ‘ 2 views

This paper establishes that the local k-Ramsey number R(K m , k -loc) is identical with the mean k-Ramsey number R(K m , k -mean). This answers part of a question raised by Caro and Tuza.

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