加载中…
2010-02-23
Chromatic number of graphs and edge Folkman numbers
Nedyalko Dimov Nenov
文献摘要
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.
讨论
0讲解博客
生成讲解博客的中文版本
AI智能校验
生成AI智能校验的中文版本