Algorithms and Combinatorics
1 primary work
Book 23
Graph Colouring and the Probabilistic Method
by Michael Molloy and Bruce Reed
Published 20 November 2001
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.