Abstract

In 1989, George R. T. Hendry presented a table of two-color graph Ramsey numbers R(G,H) for all pairs of graphs G and H having five vertices, with the exception of seven cases. Until now, only two of the these open cases were solved. This work eliminates another one by computing R(B_3,K_5) = 20, where B_3 = K_2 + K_3 is the book graph of order 5. In addition, we show that for these parameters there exists a unique up to isomorphism critical graph. The results are based on computer algorithms. Among the four remaining open cases in Hendry's table, the most notable is that of K_5 versus K_5, for which it is known that 43

Publication Date

2004

Comments

Note: imported from RIT’s Digital Media Library running on DSpace to RIT Scholar Works in February 2014.

Document Type

Article

Department, Program, or Center

Center for Advancing the Study of CyberInfrastructure

Campus

RIT – Main Campus

Share

COinS