Name
Abstract | ||
|---|---|---|
. ABSTRACT: Let k be a fixed integer and fn , p denote the probability that the random k . . graph Gn , p is k-colorable. We show that for k G 3, there exists dn such that for any k e ) 0, dn y e |
Year | DOI | Venue |
|---|---|---|
1999 | 3.0.CO;2-7" target="_self" class="small-link-text"10.1002/(SICI)1098-2418(1999010)14:13.0.CO;2-7 | Random Struct. Algorithms |
Keywords | DocType | Volume |
coloring,random graphs,sharp threshold,sharp thresholds,random graph | Journal | 14 |
Issue | Citations | PageRank |
1 | 54 | 3.15 |
References | Authors | |
6 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Dimitris Achlioptas | 1 | 2037 | 174.89 |
| Ehud Friedgut | 2 | 440 | 38.93 |