| Title:
|
GRAPH COLOURING AND THE PROBABILISTIC METHOD
|
| By: |
Michael Molloy, Bruce Reed |
| Format: |
Hardback |
| List price:
|
£99.99 |
|
We currently do not stock this item, please contact the publisher directly for
further information.
|
|
|
|
|
|
| ISBN 10: |
3540421394 |
| ISBN 13: |
9783540421399 |
| Publisher: |
SPRINGER-VERLAG BERLIN AND HEIDELBERG GMBH & CO. KG |
| Pub. date: |
20 November, 2001 |
| Edition: |
2002 ed. |
| Series: |
Algorithms and Combinatorics 23 |
| Pages: |
326 |
| Description: |
Over the years, many major advances have been made in the field of graph coloring via the probabilistic method. This title provides a unified treatment of these results, using tools such as the Lovasz Local Lemma and Talagrand's concentration inequality. |
| Synopsis: |
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. |
| Illustrations: |
XIV, 326 p. |
| Publication: |
Germany |
| Imprint: |
Springer-Verlag Berlin and Heidelberg GmbH & Co. K |
| Returns: |
Returnable |