Kniha Graph Colouring and the Probabilistic Method Michael Molloy

Graph Colouring and the Probabilistic Method

Jazyk: Angličtina
Vazba: Pevná
Dostupnost: 50 % šance
Prohledáme celý svět
3 718
Over the past decade, many major advances have been made in the field of graph colouring via the pro...

Informace o knize

Jazyk
Angličtina
Vazba
Kniha - Pevná
Vydáno
2001
Stránek
326
EAN
9783540421399
ISBN
3540421394
Enbook ID
05273971
Hmotnost
1450
Rozměry
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 zajímat

Modern Floriography

SABANKAYA TERESA
557

Red Queen

Margaret Drabble
237

Rochester

Shirley Willard
290
2 535
340
1 558

Wood Ducks

Rachel Grack
728
215
2 970

Mother Teresa

Terry Barber
347

Zákaznicí kteří koupili tuto knihu koupili také

Shifting Patterns

Eva Guttmann
1 138