Graph Colouring and the Probabilistic Method (Algorithms and Combinatorics, 23, Band 23) - Hardcover

Molloy, Michael; Reed, Bruce

 
9783540421399: Graph Colouring and the Probabilistic Method (Algorithms and Combinatorics, 23, Band 23)
Hardcover
ISBN 10: 3540421394 ISBN 13: 9783540421399
Verlag: Springer, 2001

Inhaltsangabe

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.

Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.

Verlag
Springer
Erscheinungsdatum
2001
Sprache
Englisch
ISBN 10 
3540421394
ISBN 13 
9783540421399
Einband
Gebundene Ausgabe
Anzahl der Seiten
340
Kontakt zum Hersteller
Springer Nature Customer Service Center GmbH
ProductSafety@springernature.com

Tiergartenstr. 17
Heidelberg
69121
Deutschland

Weitere beliebte Ausgaben desselben Titels

9783642040153: Graph Colouring and the Probabilistic Method (Algorithms and Combinatorics (23), Band 23)

Vorgestellte Ausgabe

ISBN 10:  3642040152 ISBN 13:  9783642040153
Verlag: Springer, 2002
Softcover