The Library
On the chromatic number of random graphs
Tools
Tools
Tools
Coja-Oghlan, Amin, Panagiotou, Konstantinos and Steger, Angelika (2008) On the chromatic number of random graphs. Journal of Combinatorial Theory, Series B, Vol.98 (No.5). pp. 980-993. doi:10.1016/j.jctb.2007.11.009 ISSN 0095-8956.
Research output not available from this repository.
Request-a-Copy directly from author or use local Library Get it For Me service.
Official URL: http://dx.doi.org/10.1016/j.jctb.2007.11.009
Abstract
In this paper we consider the classical Erdos-Renyi model of random graphs G"n","p. We show that for p=p(n)=0, the chromatic number @g(G"n","p) is a.a.s. @?, @?+1, or @?+2, where @? is the maximum integer satisfying 2(@?-1)log(@?-1)=
| Item Type: | Journal Article | ||||
|---|---|---|---|---|---|
| Subjects: | Q Science > QA Mathematics | ||||
| Divisions: | Faculty of Science, Engineering and Medicine > Science > Mathematics | ||||
| Journal or Publication Title: | Journal of Combinatorial Theory, Series B | ||||
| Publisher: | Academic Press | ||||
| ISSN: | 0095-8956 | ||||
| Official Date: | September 2008 | ||||
| Dates: |
|
||||
| Volume: | Vol.98 | ||||
| Number: | No.5 | ||||
| Page Range: | pp. 980-993 | ||||
| DOI: | 10.1016/j.jctb.2007.11.009 | ||||
| Status: | Peer Reviewed | ||||
| Publication Status: | Published | ||||
| Access rights to Published version: | Restricted or Subscription Access |
Request changes or add full text files to a record
Repository staff actions (login required)
 |
View Item |
