... finite, non-oriented graphs without loops and multiple edges. We call a p-clique of the graph G asetofp vertices, each two of which are adjacent. The largestpositive integer p, such that the graph ... for each i ∈{1, ,r}. The symbol G → (a 1, ,a r) means that there is no (a 1, ,a r)-freecoloring of the vertices of G.We consider for arbitrary natural numbers a 1, ,a rand qH (a 1, a r; ... bound for a class of vertex FolkmannumbersN. KolevDepartment of AlgebraFaculty of Mathematics and Informatics“St. Kl. Ohridski” University of So a 5 J. Bourchier blvd, 1164 So a BULGARIAN....