Chromatic number of graphs and edge Folkman numbers
Nedyalko Nenov · arXiv (Cornell University) · 2010
In the paper we give a lower bound for the number of vertices of a given graph using its chromatic number. We find the graphs for which this bound is exact. The results are applied in the theory of Foklman numbers.