Graph Colouring and the Probabilistic Method - Algorithms and Combinatorics - Michael Molloy - Books - Springer-Verlag Berlin and Heidelberg Gm - 9783540421399 - November 20, 2001
In case cover and title do not match, the title is correct

Michael Molloy
Graph Colouring and the Probabilistic Method - Algorithms and Combinatorics 2002 edition

Get an email once the item is available
Do you have a profile? Log in

Our customers say:

14-day return policy in accordance with European consumer protection law
Top ranking on Trustpilot
Add to your iMusic wish list

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.

344 pages, biography

Media Books     Hardcover Book   (Book with hard spine and cover)
Released November 20, 2001
ISBN13 9783540421399
Publishers Springer-Verlag Berlin and Heidelberg Gm
Pages 326
Dimensions 155 × 235 × 20 mm   ·   635 g

See all of Michael Molloy ( e.g. Paperback Book , Book , Bound Book , Loose-leaf and Hardcover Book )