Kniha Graph Colouring and the Probabilistic Method Michael Molloy

Graph Colouring and the Probabilistic Method

Jazyk: Angličtina
Väzba: Pevná
Dostupnosť: 50 % šanca
Prehľadáme celý svet
153.36
Over the past decade, many major advances have been made in the field of graph colouring via the pro...

Informácie o knihe

Jazyk
Angličtina
Väzba
Kniha - Pevná
Vydalo
2001
Stránok
326
EAN
9783540421399
ISBN
3540421394
Enbook ID
05273971
Hmotnosť
1450
Rozmery
155 x 235 x 24

Kompletný popis

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.

Mohlo by vás zaujímať

199.20

Red Queen

Margaret Drabble
10.47

Rochester

Shirley Willard
11.94
111.05
14.00
67.67

Wood Ducks

Rachel Grack
31.43
8.90

Mother Teresa

Terry Barber
14.29

Zákazníci, ktorí si kúpili túto knihu, kúpili tiež

Shifting Patterns

Eva Guttmann
46.90