- RIT Scholars
- B. Thomas Golisano College of Computing and Information Sciences (GCCIS)
- Dept. of Computer Science (GCCIS)
- Dept. of Computer Science (GCCIS)--Faculty Scholarship
- Dept. of Computer Science (GCCIS)--E-prints
- View Item

Redirect: | RIT Scholars content from RIT Digital Media Library has moved from http://ritdml.rit.edu/handle/1850/8720 to RIT Scholar Works http://scholarworks.rit.edu/article/348, please update your feeds & links! |

Title: | The Ramsey numbers R(K_3, K_8 - e) and R(K_3, K_9 - e) |

Author: | Radziszowski, Stanislaw |

Abstract: | We give a general construction of a triangle free graph on 4p points whose complement does not contain K_p+2 - e for p >= 4. This implies the the Ramsey number R(K_3, K_k - e) >= 4k - 7 for k >= 6. We also present a cyclic triangle free graph on 30 points whose complement does not contain K_9 - e. The first construction gives lower bounds equal to the exact values of the corresponding Ramsey number for k = 6, 7 and 8. the upper bounds are obtained by using computer algorithms. In particular, we obtain two new values of Ramsey numbers R(K_3, K_8 - e) = 25 and R(K_3, K_9 - e) = 31, the bounds 36 <= R(K_3, K_10 - e) <= 39, and the uniqueness of extremal graphs for Ramsey numbers R(K_3, K_6 - e) and R(K_3, K_7 - e). |

Record URI: | http://hdl.handle.net/1850/8720 |

Date: | 1990 |

Files | Size | Format | View | |
---|---|---|---|---|

SRadziszowskiArticle10-1990.pdf | 838.4Kb |
View/ |

The following license files are associated with this item: