A note on the warmth of random graphs with given expected degrees (Q2330255)

Summary: We consider the random graph model \(G(\mathbf{w})\) for a given expected degree sequence \(\mathbf{w} = (w_1, w_2, \dots, w_n)\). 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 \(G(\mathbf{w})\). 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 \(m = O(n^\alpha)\) with \(0 < \alpha < 1 / 2\).