Mohlo by sa vám tiež páčiť

Informovať o naskladnení knihy

Viac informácií o knihe Graph Colouring and the Probabilistic Method

• Parametre knihy
• Anotácia kniha
• Obľúbené z iného súdka

Nákupom získate 383 bodov

Anotácia knihy

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.

Parametre knihy

Zaradenie knihy Knihy po anglicky Mathematics & science Mathematics Probability & statistics

• Celý názov: Graph Colouring and the Probabilistic Method
• Autor: Michael Molloy, Bruce Reed
• Jazyk: Angličtina
• Väzba: Pevná
• Počet strán: 326
• EAN: 9783540421399
• ISBN: 3540421394
• ID: 05273971
• Nakladateľ: Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
• Hmotnosť: 1450 g
• Rozmery: 235 × 155 × 24 mm
• Dátum vydania: 20. November 2001

Obľúbené z iného súdka

---

---

---