Abstract
The Ramsey number R(Cp, Cq, Cr) is the smallest positive integer m such that no matter how one colors the edges of the Km in red, white and blue, there must be a red Cp, a white Cq or a blue Cr. In this work, we verified some known R(Cp, Cq, Cr)'s and compute some new R(Cp, Cq, Cr)'s. The results are based on computer algorithms.
| Original language | English |
|---|---|
| Pages (from-to) | 189-192 |
| Number of pages | 4 |
| Journal | Journal of Combinatorial Mathematics and Combinatorial Computing |
| Volume | 62 |
| State | Published - Aug 2007 |
Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver