Name
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)= |
Year | DOI | Venue |
|---|---|---|
2008 | 10.1016/j.jctb.2007.11.009 | international colloquium on automata, languages and programming |
Keywords | Field | DocType |
random graph,binomial random graph,chromatic number,maximum integer,random graphs,classical erdos-renyi model,satisfiability | Integer,Discrete mathematics,Combinatorics,Random graph,Chromatic scale,Mathematics | Journal |
Volume | Issue | ISSN |
98 | 5 | Journal of Combinatorial Theory, Series B |
ISBN | Citations | PageRank |
3-540-73419-8 | 7 | 0.52 |
References | Authors | |
14 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Amin Coja-Oghlan | 1 | 543 | 47.25 |
| Konstantinos Panagiotou | 2 | 290 | 27.80 |
| Angelika Steger | 3 | 995 | 111.50 |