Graph colouring and the probabilistic method Michael Molloy, Bruce Reed. Algorithms and combinatorics 23.

Molloy, Michael S.:

ISBN 10: 3540421394 / ISBN 13: 9783540421399

Edité par Berlin , Springer, 2002

Ex-library with stamp and library-signature. GOOD condition, some traces of use. Ancien Exemplaire de bibliothèque avec signature et cachet. BON état, quelques traces d'usure. Ehem. Bibliotheksexemplar mit Signatur und Stempel. GUTER Zustand, ein paar Gebrauchsspuren. 05 MOL 9783540421399 Sprache: Englisch Gewicht in Gramm: 550. N° de réf. du vendeur 2498439

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 : Berlin , Springer
Date d'édition : 2002
Reliure : Hardcover