The topics covered include: Kahn's proofs that the Goldberg-Seymour and List Colouring Conjectures hold asymptotically; a proof that for some absolute constant C, every graph of maximum degree Delta has a Delta+C total colouring; Johansson's proof that a triangle free graph has a O(Delta over log Delta) colouring; algorithmic variants of the Local Lemma which permit the efficient construction of many optimal and near-optimal colourings.
This begins with a gentle introduction to the probabilistic method and will be useful to researchers and graduate students in graph theory, discrete mathematics, theoretical computer science and probability.
The topics covered include: Kahn's proofs that the Goldberg-Seymour and List Colouring Conjectures hold asymptotically; a proof that for some absolute constant C, every graph of maximum degree Delta has a Delta+C total colouring; Johansson's proof that a triangle free graph has a O(Delta over log Delta) colouring; algorithmic variants of the Local Lemma which permit the efficient construction of many optimal and near-optimal colourings.
This begins with a gentle introduction to the probabilistic method and will be useful to researchers and graduate students in graph theory, discrete mathematics, theoretical computer science and probability.

Graph Colouring and the Probabilistic Method
326
Graph Colouring and the Probabilistic Method
326Hardcover(2002)
Product Details
ISBN-13: | 9783540421399 |
---|---|
Publisher: | Springer Berlin Heidelberg |
Publication date: | 12/06/2001 |
Series: | Algorithms and Combinatorics , #23 |
Edition description: | 2002 |
Pages: | 326 |
Product dimensions: | 6.10(w) x 9.25(h) x 0.03(d) |