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
β¦ 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
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
Diagonal Ramsey numbers for small graphs
β
S. A. Burr
π
Article
π
1983
π
John Wiley and Sons
π
English
β 430 KB