Threshold Phenomena in Random Graph Colouring and Satisfiability (1999)
| Citations: | 23 - 4 self |
BibTeX
@MISC{Achlioptas99thresholdphenomena,
author = {Dimitris Achlioptas},
title = {Threshold Phenomena in Random Graph Colouring and Satisfiability},
year = {1999}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
We study threshold phenomena pertaining to the colourability of random graphs and the satisfiability of random formulas. Consider a random graph G(n, p) on n vertices formed by including each of the possible edges independently of all others with probability p. For a fixed integer k, let f k (n, d) = Pr[G(n, d/n) is k-colourable]. Erdos asked the following fundamental question: for k 3, is there a constant c k such that for any # > 0, #) = 1 , and lim f k (n, c k + #) = 0 ? (1) We prove that for all k 3, there exists a function t k (n) such that (1) holds upon replacing c k by t k (n), thus establishing that indeed k-colourability has a sharp threshold. Let d k = sup{d lim n## f k (n, d) = 1}. Note that if c k exists then, by definition, c k = d k . For the basic and most studied case k = 3 we prove 3.84 < d 3 < 5.05 . These are the best
