Graph Colouring and the Probabilistic Method
Produktnummer:
18e67ed111f185442ea48e94a66e618ffb
| Autor: | Molloy, Michael Reed, Bruce |
|---|---|
| Themengebiete: | Graph Graph theory Matching Matchings algorithm analysis and problem complexity algorithms combinatorics computer computer science |
| Veröffentlichungsdatum: | 20.11.2001 |
| EAN: | 9783540421399 |
| Sprache: | Englisch |
| Seitenzahl: | 326 |
| Produktart: | Gebunden |
| Verlag: | Springer Berlin |
Produktinformationen "Graph Colouring and the Probabilistic Method"
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.
Sie möchten lieber vor Ort einkaufen?
Sie haben Fragen zu diesem oder anderen Produkten oder möchten einfach gerne analog im Laden stöbern? Wir sind gerne für Sie da und beraten Sie auch telefonisch.
Juristische Fachbuchhandlung
Georg Blendl
Parcellistraße 5 (Maxburg)
8033 München
Montag - Freitag: 8:15 -18 Uhr
Samstags geschlossen