On the Vertex Folkman Numbers
arXiv:0903.3812
Abstract
For a graph the symbol $G\tov(a_1,...,a_r)$ means that in every -coloring of the vertices of for some there exists a monochromatic -clique of color . The vertex Folkman numbers \[ \FN=\min\{|V(G)|:G\tov(a_1,...,a_r)\text{and}K_q\nsubseteqq G\} \] are considered. In this paper we shall compute the Folkman numbers when and is sufficiently large. We prove also new bounds for some vertex and edge Folkman numbers.
arXiv comment21 pages