Chromatic number of graphs and edge Folkman numbers
Combinatorics
2010-02-24 v1
Abstract
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.
Cite
@article{arxiv.1002.4332,
title = {Chromatic number of graphs and edge Folkman numbers},
author = {Nedyalko Dimov Nenov},
journal= {arXiv preprint arXiv:1002.4332},
year = {2010}
}
Comments
9 pages, 1 figure