Abstract

The Ramsey number R(C4, Km) is the smallest n such that any graph on n vertices contains a cycle of length four or an independent set of order m. With the help of computer algorithms we obtain the exact values of the Ramsey numbers R(C4, K9) = 30 and R(C4, K10) = 36. New bounds for the next two open cases are also presented.

Publication Date

5-2016

Document Type

Article

Department, Program, or Center

Computer Science (GCCIS)

Campus

RIT – Main Campus

Available for download on Friday, July 12, 2019

Share

COinS