期刊名称：International Journal of Mathematics and Mathematical Sciences
印刷版ISSN：0161-1712
电子版ISSN：1687-0425
出版年度：2014
卷号：2014
DOI：10.1155/2014/749856
出版社：Hindawi Publishing Corporation
摘要：We consider the random graph model for a given expected degree sequence . Warmth, introduced by Brightwell and Winkler in the context of combinatorial statistical mechanics, is a graph parameter related to lower bounds of chromatic number. We present new upper and lower bounds on warmth of . In particular, the minimum expected degree turns out to be an upper bound of warmth when it tends to infinity and the maximum expected degree with .
