Mohlo by se vám také líbit

Více informací o knize Graph Colouring and the Probabilistic Method

• Parametry knihy
• Anotace
• Oblíbené z jiného soudku

Nákupem získáte 480 bodů

Anotace 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.

Parametry knihy

Zařazení knihy Knihy v angličtině Mathematics & science Mathematics Probability & statistics

• Plný název: Graph Colouring and the Probabilistic Method
• Autor: Michael Molloy, Bruce Reed
• Jazyk: Angličtina
• Vazba: Pevná
• Počet stran: 326
• EAN: 9783540421399
• ISBN: 3540421394
• ID: 05273971
• Nakladatelství: Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
• Hmotnost: 1450 g
• Rozměry: 235 × 155 × 24 mm
• Datum vydání: 20. November 2001

---

---

---