Abstract
The graph is called a -Ramsey graph if in every coloring of the edges of in two colors there is a monochromatic triangle. The minimum number of vertices of the -Ramsey graphs without 4-cliques is denoted by . The number is referred to as the most wanted Folkman number. It is known that . In this paper we prove that if is an -vertex -Ramsey graph without 4-cliques, then , where denotes the independence number of . Using the newly obtained bound on and complex computer calculations we obtain the new lower bound
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.