Chromatic Vertex Folkman Numbers

Xiaodong Xu, Meilian Liang, Stanisław Radziszowski

For graph $G$ and integers $a_1\ge \cdots \ge a_r\ge 2$, we write $G\to (a_1,\cdots ,a_r{)}^v$ if and only if for every $r$-coloring of the vertex set $V(G)$ there exists…