Bookbot

Graph colouring and the probabilistic method

Book rating

5.0(5)Add rating

Parameters

  • 240 pages
  • 9 hours of reading

More about the book

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.

Book purchase

Graph colouring and the probabilistic method, Michael Molloy

Language
Released
2002
product-detail.submit-box.info.binding
(Hardcover)
We’ll email you as soon as we track it down.

Payment methods

5.0
Excellent
5 Ratings

We’re missing your review here.