Könyv Graph Colouring and the Probabilistic Method Michael Molloy

Graph Colouring and the Probabilistic Method

Nyelv: Angol
Kötés: Kemény kötésű
Elérhetőség: 50 % esély
Keressük az egész világon
54 557 Ft
Over the past decade, many major advances have been made in the field of graph colouring via the pro...

Információk a könyvről

Nyelv
Angol
Kötés
Könyv - Kemény kötésű
Kiadva
2001
oldal
326
EAN
9783540421399
ISBN
3540421394
Enbook ID
05273971
Súly
1450
Méretek
155 x 235 x 24

Teljes leírás

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.

Érdekelheti

Red Queen

Margaret Drabble
3 972 Ft

Rochester

Shirley Willard
4 255 Ft
43 210 Ft
5 539 Ft
25 266 Ft

Wood Ducks

Rachel Grack
11 984 Ft
3 658 Ft

Mother Teresa

Terry Barber
5 763 Ft

Azok a vásárlók, akik ezt a könyvet megvásárolták, a következőket is megvásárolták