Graph Colouring and the Probabilistic Method (Algorithms and Combinatorics)

Michael Molloy

ISBN 10: 3540421394 / ISBN 13: 9783540421399

Edité par Springer, 2002

2002 edition. 240 pages. 9.25x6.25x1.00 inches. In Stock. N° de réf. du vendeur x-3540421394

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.

Détails bibliographiques

Titre : Graph Colouring and the Probabilistic Method...
Éditeur : Springer
Date d'édition : 2002
Reliure : Hardcover
Etat : Brand New