Computation of the Ramsey Numbers R(C4,K9)R(C_4,K_9) and R(C4,K10)R(C_4,K_{10})

preprint2013arXivOpen access

Abstract

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

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.