A Note on the Warmth of Random Graphs with Given Expected Degrees

We consider the random graph model G(w) for a given expected degree sequence w=(w1,w2,…,wn). 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...

Full description

Bibliographic Details
Main Author: Yilun Shang
Format: Article
Language:English
Published: Hindawi Limited 2014-01-01
Series:International Journal of Mathematics and Mathematical Sciences
Online Access:http://dx.doi.org/10.1155/2014/749856