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

Yilun Shang

International Journal of Mathematics and Mathematical Sciences, 2014, vol. 2014, 1-4

Abstract:

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 .

Date: 2014
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/IJMMS/2014/749856.pdf (application/pdf)
http://downloads.hindawi.com/journals/IJMMS/2014/749856.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jijmms:749856

DOI: 10.1155/2014/749856

Access Statistics for this article

More articles in International Journal of Mathematics and Mathematical Sciences from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().