Graph Colouring and the Probabilistic Method - Algorithms and Combinatorics Softcover reprint of the original 1st ed. 2002 edition

Over the past decade, many major advances have been made in the field of graph coloring via the probabilistic method. This monograph, by two of the best on the topic, provides an accessible and unified treatment of these results, using tools such as the Lovasz Local Lemma and Talagrand's concentration inequality.