Graph Colouring and the Probabilistic Method / Edition 1 by Michael Molloy, Bruce Reed | | 9783540421399 | Hardcover | Barnes & Noble
Graph Colouring and the Probabilistic Method / Edition 1

Graph Colouring and the Probabilistic Method / Edition 1

by Michael Molloy, Bruce Reed
     
 

ISBN-10: 3540421394

ISBN-13: 9783540421399

Pub. Date: 12/06/2001

Publisher: Springer Berlin Heidelberg

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.

Overview

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.

Product Details

ISBN-13:
9783540421399
Publisher:
Springer Berlin Heidelberg
Publication date:
12/06/2001
Series:
Algorithms and Combinatorics Series, #23
Edition description:
2002
Pages:
326
Product dimensions:
6.10(w) x 9.25(h) x 0.03(d)

Table of Contents

1. Colouring Preliminaries.- 2. Probabilistic Preliminaries.- 3. The First Moment Method.- 4. The Lovász Local Lemma.- 5. The Chernoff Bound.- 6. Hadwiger’s Conjecture.- 7. A First Glimpse of Total Colouring.- 8. The Strong Chromatic Number.- 9. Total Colouring Revisited.- 10. Talagrand’s Inequality and Colouring Sparse Graphs.- 11. Azuma’s Inequality and a Strengthening of Brooks’ Theorem.- 12. Graphs with Girth at Least Five.- 13. Triangle-Free Graphs.- 14. The List Colouring Conjecture.- 15. The Structural Decomposition.- 16.—,— and—.- 17. Near Optimal Total Colouring I: Sparse Graphs.- 18. Near Optimal Total Colouring II: General Graphs.- 19. Generalizations of the Local Lemma.- 20. A Closer Look at Talagrand’s Inequality.- 21. Finding Fractional Colourings and Large Stable Sets.- 22. Hard-Core Distributions on Matchings.- 23. The Asymptotics of Edge Colouring Multigraphs.- 24. The Method of Conditional Expectations.- 25. Algorithmic Aspects of the Local Lemma.- References.

Customer Reviews

Average Review:

Write a Review

and post it to your social network

     

Most Helpful Customer Reviews

See all customer reviews >