 |
|
|
Item Details
| Title:
|
GRAPH COLOURING AND THE PROBABILISTIC METHOD
|
| By: |
Michael Molloy, Bruce Reed |
| Format: |
Paperback |
| List price:
|
£79.99 |
| Our price: |
£69.99 |
| Discount: |
|
| You save:
|
£10.00 |
|
|
|
|
|
| ISBN 10: |
3642040152 |
| ISBN 13: |
9783642040153 |
| Availability: |
Not yet published. (You may still order this item, and we will dispatch your order as soon as it becomes available.)
 Delivery
rates
|
| Stock: |
Currently 0 available |
| Publisher: |
SPRINGER-VERLAG BERLIN AND HEIDELBERG GMBH & CO. KG |
| Pub. date: |
Not yet published |
| Edition: |
2002 ed. |
| Series: |
Algorithms and Combinatorics 23 |
| Pages: |
340 |
| Synopsis: |
Over the past decade, many major advances have been made in the field of graph colouring via the probabilistic method. This monograph provides an accessible and unified treatment of these results, using tools such as the Lovasz Local Lemma and Talagrand's concentration inequality.The topics covered include: Kahn's proofs that the Goldberg-Seymour and List Colouring Conjectures hold asymptotically; a proof that for some absolute constant C, every graph of maximum degree Delta has a Delta+C total colouring; Johansson's proof that a triangle free graph has a O(Delta over log Delta) colouring; algorithmic variants of the Local Lemma which permit the efficient construction of many optimal and near-optimal colourings. This begins with a gentle introduction to the probabilistic method and will be useful to researchers and graduate students in graph theory, discrete mathematics, theoretical computer science and probability. From the reviews: "a ] We think that this well-written monograph will serve as a main reference on the subject for years to come." JAnos BarAt, Acta Scientiarum Mathematicarum 69, 2003 "The book is a pleasure to read; there is a clear, successful attempt to present the intuition behind the proofs, making even the difficult, recent proofs of important results accessible to potential readers. a ] The book is highly recommended to researchers and graduate students in graph theory, combinatorics, and theoretical computer science who wish to have this ability." Noga Alon, SIAM Review 45 (2), 2003 "This monograph provides an accessible and unified treatment of major advances made in graph colouring via the probabilistic method. a ] Many exercises and excellent remarks are presented and discussed. Also very useful is the list of up-to-date references for current research. This monograph will be useful both to researchers and graduate students in graph theory, discrete mathematics, theoretical computer science and probability." Jozef Fiamcik, Zentralblatt MATH 987 (12), 2002 |
| Illustrations: |
19 black & white illustrations |
| Publication: |
Germany |
| Imprint: |
Springer-Verlag Berlin and Heidelberg GmbH & Co. K |
| Returns: |
Returnable |
|
|
|
 |
|
|
|
|
|
Little Worried Caterpillar (PB)
Little Green knows she''s about to make a big change - transformingfrom a caterpillar into a beautiful butterfly. Everyone is VERYexcited! But Little Green is VERY worried. What if being a butterflyisn''t as brilliant as everyone says?Join Little Green as she finds her own path ... with just a littlehelp from her friends.
|
|
All the Things We Carry PB
What can you carry?A pebble? A teddy? A bright red balloon? A painting you''ve made?A hope or a dream?This gorgeous, reassuring picture book celebrates all the preciousthings we can carry, from toys and treasures to love and hope. With comforting rhymes and fabulous illustrations, this is a warmhug of a picture book.
|
|
|
|