For a graph G and integers $$a_i\ge 1$$ , the expression $$G \rightarrow (a_1,\ldots ,a_r)^v$$ means that for any r-coloring of vertices there exists monochromatic $$a_i$$ -clique in some color $$i \in \{1,\ldots ,r\}$$ . The vertex Folkman numbers are defined as $$F_v(a_1,\ldots ,a_r;H) = \min \{|V(G)| : G$$ is H-free ,a_r)^v\}$$ where H graph. Such have been extensively studied $$H=K_s$$ with...