Kontakt
Jak kupować
Dostawa
Doradca ds. zakupów
Graph Colouring and the Probabilistic Method
Angielski
383 b
Nawet do 30 dni na zwrot
Klienci kupili także
/
Miękka
67.91
zł
/
Miękka
63.10
zł
/
Twarda
230.50
zł
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.
Informacje o książce
Angielski
Kategoria
Podaruj tę książkę jeszcze dziś
To łatwe
1 Dodaj książkę do koszyka i wybierz „dostarczyć jako prezent” 2 W odpowiedzi wyślemy Ci bon 3 Książka dotrze na adres obdarowanegoMogłoby Cię także zainteresować
/
Adobe ePub DRM
155.61
zł
/
Twarda
750.54
zł
/
Miękka
1 038.83
zł
