Code: 05273971
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 Lo ... more
English
158.21 €
Availability:
50/50
We think title might be available. Upon your order we will do our best to get it within 6 weeks.
Enter your e-mail address and once book will be available,
we will send you a message. It's that simple.
You get 383 loyalty points
Book synopsis
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.
Book details
Book category Books in English Mathematics & science Mathematics Probability & statistics
158.21 €
English
Collection points Bratislava a 12927 dalších
Copyright ©2008-26 najlacnejsie-knihy.sk All rights reservedPrivacyCookies
25858 collection points
Delivery 2.99 €
02/210 210 99 (8-15.30h)Shopping cart ( Empty )