Graph Colouring and the Probabilistic Method - Couverture rigide

Molloy, Michael; Reed, Bruce

Couverture rigide

ISBN 10 : 3540421394 ISBN 13 : 9783540421399

Editeur : Springer-Verlag Berlin and Heidelberg GmbH & Co. K, 2001

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 de l'édition

• Éditeur: Springer-Verlag Berlin and Heidelberg GmbH & Co. K
• Date d'édition: 2001
• Langue: anglais
• ISBN 10: 3540421394
• ISBN 13: 9783540421399
• Reliure: Relié
• Nombre de pages: 326
• Coordonnées du fabricant: non disponible
• Personne responsable: CMN Printpool Inh. Mathis Neumann; https://www.also.com/ec/cms5/en_6000/6000/index.jsp; ; Friedrich-Karl-Str. 9; Hamburg; Allemagne