Graph Colouring and the Probabilistic Method - Algorithms and Combinatorics No. 23 (Paperback)
  • Graph Colouring and the Probabilistic Method - Algorithms and Combinatorics No. 23 (Paperback)

Graph Colouring and the Probabilistic Method - Algorithms and Combinatorics No. 23 (Paperback)

, ,
£44.99
Paperback Published: 01/10/2009
  • We can order this

Usually despatched within 3 weeks

  • This item has been added to your basket

Check Marketplace availability

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

Publisher: Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
ISBN: 9783642040153

You may also be interested in...

Your review has been submitted successfully.

We would love to hear what you think of Waterstones. Why not review Waterstones on Trustpilot?


Review us on Trustpilot