On mixed ramsey numbers
✍ Scribed by Nirmala Achuthan; N.R. Achuthan; L. Caccetta
- Publisher
- Elsevier Science
- Year
- 1996
- Tongue
- English
- Weight
- 466 KB
- Volume
- 151
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
## for my mentors don bonar and gerald thompson We prove the following relation between regressive and classical Ramsey numbers ¼ 8; R 4 reg ð6Þ ¼ 15; and R 5 reg ð7Þ536: We prove that R 2 xþk ð4Þ42 kþ1 ð3 þ kÞ À ðk þ 1Þ; and use this to compute R 2 reg ð5Þ ¼ 15: Finally, we provide the bounds 19
## 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
For n = 1, 2, . . . , let 6, = K2+ K,,. We pose the problem of determining the Ramsey numbers r(&, B,) and demonstrate that in many cases critical colorings are available from known examples of strongly regular graphs.