Abstract
The Ramsey number is the smallest such that any graph on vertices contains a cycle of length four or an independent set of order . With the help of computer algorithms we obtain the exact values of the Ramsey numbers and . New bounds for the next two open cases are also presented.
Connections
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 review
No reviews yet.
Discussion 0
Add a comment
No comments yet.