Stock image for illustration purposes only - book cover, edition or condition may vary.
Graph Colouring and the Probabilistic Method
Molloy, Michael; Reed, Bruce
€ 184.20
FREE Delivery in Ireland
Description for Graph Colouring and the Probabilistic Method
Hardback. 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. Series: Algorithms and Combinatorics. Num Pages: 340 pages, biography. BIC Classification: PBT; PBV; UYA. Category: (P) Professional & Vocational; (UP) Postgraduate, Research & Scholarly. Dimension: 234 x 156 x 20. Weight in Grams: 1450.
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 ... Read more
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 ... Read more
Product Details
Format
Hardback
Publication date
2001
Publisher
Springer-Verlag Berlin and Heidelberg GmbH & Co. KG Germany
Number of pages
340
Condition
New
Series
Algorithms and Combinatorics
Number of Pages
326
Place of Publication
Berlin, Germany
ISBN
9783540421399
SKU
V9783540421399
Shipping Time
Usually ships in 15 to 20 working days
Ref
99-15
Reviews for Graph Colouring and the Probabilistic Method
From the reviews of the first edition: "The presented book contains many … chapters, each of which presents a proof technique and apply that for a certain graph coloring problem. … The book ends with a vast bibliography. We think that this well-written monograph will serve as a main reference on the subject for years ... Read more